TSTP Solution File: ALG171+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG171+1 : TPTP v8.1.2. Released v2.7.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 : n026.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:32:16 EDT 2023
% Result : Theorem 74.13s 62.68s
% Output : CNFRefutation 74.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 75 ( 74 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 99 ( 38 ~; 4 |; 57 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ op > #nlpp > e4 > e3 > e2 > e1 > e0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(e1,type,
e1: $i ).
tff(e0,type,
e0: $i ).
tff(e2,type,
e2: $i ).
tff(op,type,
op: ( $i * $i ) > $i ).
tff(e4,type,
e4: $i ).
tff(e3,type,
e3: $i ).
tff(f_1157,axiom,
( ( e0 = op(e4,op(e4,e4)) )
& ( e1 = op(e4,e4) )
& ( e2 = op(op(e4,op(e4,e4)),op(e4,e4)) )
& ( e3 = op(op(e4,op(e4,e4)),op(e4,op(e4,e4))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
tff(f_1283,negated_conjecture,
~ ~ ( ( ( ( op(e0,e0) != e0 )
& ( op(e1,e0) != e1 )
& ( op(e2,e0) != e2 )
& ( op(e3,e0) != e3 )
& ( op(e4,e0) != e4 ) )
| ( ( op(e0,e1) != e0 )
& ( op(e1,e1) != e1 )
& ( op(e2,e1) != e2 )
& ( op(e3,e1) != e3 )
& ( op(e4,e1) != e4 ) )
| ( ( op(e0,e2) != e0 )
& ( op(e1,e2) != e1 )
& ( op(e2,e2) != e2 )
& ( op(e3,e2) != e3 )
& ( op(e4,e2) != e4 ) )
| ( ( op(e0,e3) != e0 )
& ( op(e1,e3) != e1 )
& ( op(e2,e3) != e2 )
& ( op(e3,e3) != e3 )
& ( op(e4,e3) != e4 ) )
| ( ( op(e0,e4) != e0 )
& ( op(e1,e4) != e1 )
& ( op(e2,e4) != e2 )
& ( op(e3,e4) != e3 )
& ( op(e4,e4) != e4 ) ) )
& ( op(e0,op(e0,e0)) = e0 )
& ( op(e0,op(e0,e1)) = e1 )
& ( op(e0,op(e0,e2)) = e2 )
& ( op(e0,op(e0,e3)) = e3 )
& ( op(e0,op(e0,e4)) = e4 )
& ( op(e1,op(e1,e0)) = e0 )
& ( op(e1,op(e1,e1)) = e1 )
& ( op(e1,op(e1,e2)) = e2 )
& ( op(e1,op(e1,e3)) = e3 )
& ( op(e1,op(e1,e4)) = e4 )
& ( op(e2,op(e2,e0)) = e0 )
& ( op(e2,op(e2,e1)) = e1 )
& ( op(e2,op(e2,e2)) = e2 )
& ( op(e2,op(e2,e3)) = e3 )
& ( op(e2,op(e2,e4)) = e4 )
& ( op(e3,op(e3,e0)) = e0 )
& ( op(e3,op(e3,e1)) = e1 )
& ( op(e3,op(e3,e2)) = e2 )
& ( op(e3,op(e3,e3)) = e3 )
& ( op(e3,op(e3,e4)) = e4 )
& ( op(e4,op(e4,e0)) = e0 )
& ( op(e4,op(e4,e1)) = e1 )
& ( op(e4,op(e4,e2)) = e2 )
& ( op(e4,op(e4,e3)) = e3 )
& ( op(e4,op(e4,e4)) = e4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_1150,axiom,
( ( e0 != e1 )
& ( e0 != e2 )
& ( e0 != e3 )
& ( e0 != e4 )
& ( e1 != e2 )
& ( e1 != e3 )
& ( e1 != e4 )
& ( e2 != e3 )
& ( e2 != e4 )
& ( e3 != e4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
tff(c_428,plain,
op(e4,op(e4,e4)) = e0,
inference(cnfTransformation,[status(thm)],[f_1157]) ).
tff(c_430,plain,
op(e4,op(e4,e4)) = e4,
inference(cnfTransformation,[status(thm)],[f_1283]) ).
tff(c_6729,plain,
e4 = e0,
inference(demodulation,[status(thm),theory(equality)],[c_428,c_430]) ).
tff(c_426,plain,
op(e4,e4) = e1,
inference(cnfTransformation,[status(thm)],[f_1157]) ).
tff(c_9873,plain,
op(e0,e0) = e1,
inference(demodulation,[status(thm),theory(equality)],[c_6729,c_6729,c_426]) ).
tff(c_478,plain,
op(e0,op(e0,e0)) = e0,
inference(cnfTransformation,[status(thm)],[f_1283]) ).
tff(c_9874,plain,
op(e0,e1) = e0,
inference(demodulation,[status(thm),theory(equality)],[c_9873,c_478]) ).
tff(c_424,plain,
op(op(e4,op(e4,e4)),op(e4,e4)) = e2,
inference(cnfTransformation,[status(thm)],[f_1157]) ).
tff(c_10453,plain,
e2 = e0,
inference(demodulation,[status(thm),theory(equality)],[c_9874,c_9873,c_9874,c_9873,c_6729,c_6729,c_6729,c_6729,c_6729,c_424]) ).
tff(c_418,plain,
e2 != e0,
inference(cnfTransformation,[status(thm)],[f_1150]) ).
tff(c_10614,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10453,c_418]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG171+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.12 % 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.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 20:41:47 EDT 2023
% 0.12/0.33 % CPUTime :
% 74.13/62.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 74.13/62.68
% 74.13/62.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 74.13/62.71
% 74.13/62.71 Inference rules
% 74.13/62.71 ----------------------
% 74.13/62.71 #Ref : 0
% 74.13/62.71 #Sup : 0
% 74.13/62.71 #Fact : 0
% 74.13/62.71 #Define : 0
% 74.13/62.71 #Split : 0
% 74.13/62.71 #Chain : 0
% 74.13/62.71 #Close : 0
% 74.13/62.71
% 74.13/62.71 Ordering : KBO
% 74.13/62.71
% 74.13/62.71 Simplification rules
% 74.13/62.71 ----------------------
% 74.13/62.71 #Subsume : 3341
% 74.13/62.71 #Demod : 10223
% 74.13/62.71 #Tautology : 22
% 74.13/62.71 #SimpNegUnit : 0
% 74.13/62.71 #BackRed : 0
% 74.13/62.71
% 74.13/62.71 #Partial instantiations: 0
% 74.13/62.71 #Strategies tried : 1
% 74.13/62.71
% 74.13/62.71 Timing (in seconds)
% 74.13/62.71 ----------------------
% 74.13/62.72 Preprocessing : 1.24
% 74.13/62.72 Parsing : 0.46
% 74.13/62.72 CNF conversion : 0.10
% 74.13/62.72 Main loop : 60.41
% 74.13/62.72 Inferencing : 0.00
% 74.13/62.72 Reduction : 9.22
% 74.13/62.72 Demodulation : 7.82
% 74.13/62.72 BG Simplification : 0.26
% 74.13/62.72 Subsumption : 49.31
% 74.13/62.72 Abstraction : 0.25
% 74.13/62.72 MUC search : 0.00
% 74.13/62.72 Cooper : 0.00
% 74.13/62.72 Total : 61.71
% 74.13/62.72 Index Insertion : 0.00
% 74.13/62.72 Index Deletion : 0.00
% 74.13/62.72 Index Matching : 0.00
% 74.13/62.72 BG Taut test : 0.00
%------------------------------------------------------------------------------