TSTP Solution File: LCL656+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Aug 22 10:48:38 EDT 2023
% Result : Theorem 3.09s 1.73s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 23 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 95 ( 46 ~; 35 |; 14 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 8 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 14 (; 13 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p2 > p102 > p101 > p100 > p1 > #nlpp > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(p101,type,
p101: $i > $o ).
tff(p102,type,
p102: $i > $o ).
tff(p100,type,
p100: $i > $o ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(p2,type,
p2: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(p1,type,
p1: $i > $o ).
tff(f_146,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ( ( ( ~ ! [X] :
( ~ r1(Y,X)
| ~ ( ~ p2(X)
& ~ p102(X)
& p101(X) ) )
& ~ ! [X] :
( ~ r1(Y,X)
| ~ ( p2(X)
& ~ p102(X)
& p101(X) ) ) )
| ~ ( ~ p101(Y)
& p100(Y) ) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p2(X)
| ~ p101(X) )
| p2(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ p101(X) )
| ~ p2(Y) ) )
| ~ p101(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p1(X)
| ~ p100(X) )
| p1(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p1(X)
| ~ p100(X) )
| ~ p1(Y) ) )
| ~ p100(Y) )
& ( p101(Y)
| ~ p102(Y) )
& ( p100(Y)
| ~ p101(Y) ) ) )
& ~ p101(X)
& p100(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(f_29,axiom,
! [X] : r1(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
tff(c_6,plain,
~ p101('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_2,plain,
! [X_1] : r1(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_4,plain,
p100('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_65,plain,
! [Y_38] :
( r1(Y_38,'#skF_2'(Y_38))
| ~ p100(Y_38)
| p101(Y_38)
| ~ r1('#skF_1',Y_38) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_8,plain,
! [Y_16] :
( p2(Y_16)
| ~ r1('#skF_1',Y_16) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_77,plain,
( p2('#skF_2'('#skF_1'))
| ~ p100('#skF_1')
| p101('#skF_1')
| ~ r1('#skF_1','#skF_1') ),
inference(resolution,[status(thm)],[c_65,c_8]) ).
tff(c_88,plain,
( p2('#skF_2'('#skF_1'))
| p101('#skF_1') ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_77]) ).
tff(c_89,plain,
p2('#skF_2'('#skF_1')),
inference(negUnitSimplification,[status(thm)],[c_6,c_88]) ).
tff(c_34,plain,
! [Y_17] :
( ~ p2('#skF_2'(Y_17))
| ~ p100(Y_17)
| p101(Y_17)
| ~ r1('#skF_1',Y_17) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_117,plain,
( ~ p100('#skF_1')
| p101('#skF_1')
| ~ r1('#skF_1','#skF_1') ),
inference(resolution,[status(thm)],[c_89,c_34]) ).
tff(c_120,plain,
p101('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_117]) ).
tff(c_122,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 14:01:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.09/1.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/1.73
% 3.09/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.09/1.76
% 3.09/1.76 Inference rules
% 3.09/1.76 ----------------------
% 3.09/1.76 #Ref : 0
% 3.09/1.76 #Sup : 10
% 3.09/1.76 #Fact : 0
% 3.09/1.76 #Define : 0
% 3.09/1.76 #Split : 0
% 3.09/1.76 #Chain : 0
% 3.09/1.76 #Close : 0
% 3.09/1.76
% 3.09/1.76 Ordering : KBO
% 3.09/1.76
% 3.09/1.76 Simplification rules
% 3.09/1.76 ----------------------
% 3.09/1.76 #Subsume : 2
% 3.09/1.76 #Demod : 15
% 3.09/1.76 #Tautology : 0
% 3.09/1.76 #SimpNegUnit : 8
% 3.09/1.76 #BackRed : 0
% 3.09/1.76
% 3.09/1.76 #Partial instantiations: 0
% 3.09/1.76 #Strategies tried : 1
% 3.09/1.76
% 3.09/1.76 Timing (in seconds)
% 3.09/1.76 ----------------------
% 3.09/1.76 Preprocessing : 0.47
% 3.09/1.76 Parsing : 0.27
% 3.09/1.76 CNF conversion : 0.03
% 3.09/1.76 Main loop : 0.24
% 3.09/1.76 Inferencing : 0.10
% 3.09/1.76 Reduction : 0.05
% 3.09/1.76 Demodulation : 0.04
% 3.09/1.76 BG Simplification : 0.02
% 3.09/1.76 Subsumption : 0.06
% 3.09/1.76 Abstraction : 0.01
% 3.09/1.76 MUC search : 0.00
% 3.09/1.76 Cooper : 0.00
% 3.09/1.76 Total : 0.75
% 3.09/1.76 Index Insertion : 0.00
% 3.09/1.76 Index Deletion : 0.00
% 3.09/1.76 Index Matching : 0.00
% 3.09/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------