TSTP Solution File: ALG039+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG039+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 : n015.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:30:59 EDT 2023
% Result : Theorem 7.24s 2.83s
% Output : CNFRefutation 7.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 96 ( 95 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 91 ( 21 ~; 39 |; 31 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 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 > unit > 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(unit,type,
unit: $i ).
tff(e3,type,
e3: $i ).
tff(f_590,axiom,
( ( e0 != e1 )
& ( e0 != e2 )
& ( e0 != e3 )
& ( e1 != e2 )
& ( e1 != e3 )
& ( e2 != e3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
tff(f_593,axiom,
( ( e0 = op(e1,e1) )
& ( e2 = op(e3,e1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
tff(f_659,negated_conjecture,
~ ~ ( ( ( ( op(e0,e0) = e0 )
& ( op(e1,e1) = e0 )
& ( op(e2,e2) = e0 )
& ( op(e3,e3) = e0 ) )
| ( ( op(e0,e0) = e1 )
& ( op(e1,e1) = e1 )
& ( op(e2,e2) = e1 )
& ( op(e3,e3) = e1 ) )
| ( ( op(e0,e0) = e2 )
& ( op(e1,e1) = e2 )
& ( op(e2,e2) = e2 )
& ( op(e3,e3) = e2 ) )
| ( ( op(e0,e0) = e3 )
& ( op(e1,e1) = e3 )
& ( op(e2,e2) = e3 )
& ( op(e3,e3) = e3 ) ) )
& ~ ( ( ( op(e0,e0) = e0 )
& ( op(e1,e1) = e0 )
& ( op(e2,e2) = e0 )
& ( op(e3,e3) = e0 ) )
| ( ( op(e0,e0) = e1 )
& ( op(e1,e1) = e1 )
& ( op(e2,e2) = e1 )
& ( op(e3,e3) = e1 ) )
| ( ( op(e0,e0) = e2 )
& ( op(e1,e1) = e2 )
& ( op(e2,e2) = e2 )
& ( op(e3,e3) = e2 ) )
| ( ( op(e0,e0) = e3 )
& ( op(e1,e1) = e3 )
& ( op(e2,e2) = e3 )
& ( op(e3,e3) = e3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_218,plain,
e3 != e0,
inference(cnfTransformation,[status(thm)],[f_590]) ).
tff(c_220,plain,
e2 != e0,
inference(cnfTransformation,[status(thm)],[f_590]) ).
tff(c_222,plain,
e1 != e0,
inference(cnfTransformation,[status(thm)],[f_590]) ).
tff(c_226,plain,
op(e1,e1) = e0,
inference(cnfTransformation,[status(thm)],[f_593]) ).
tff(c_574,plain,
( ( op(e2,e2) = e0 )
| ( op(e1,e1) = e1 )
| ( op(e1,e1) = e2 )
| ( op(e1,e1) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_659]) ).
tff(c_806,plain,
( ( op(e2,e2) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_226,c_226,c_574]) ).
tff(c_931,plain,
( ( op(e2,e2) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_222,c_806]) ).
tff(c_977,plain,
( ( op(e2,e2) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_220,c_931]) ).
tff(c_989,plain,
op(e2,e2) = e0,
inference(negUnitSimplification,[status(thm)],[c_218,c_977]) ).
tff(c_572,plain,
( ( op(e3,e3) = e0 )
| ( op(e1,e1) = e1 )
| ( op(e1,e1) = e2 )
| ( op(e1,e1) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_659]) ).
tff(c_807,plain,
( ( op(e3,e3) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_226,c_226,c_572]) ).
tff(c_938,plain,
( ( op(e3,e3) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_222,c_807]) ).
tff(c_976,plain,
( ( op(e3,e3) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_220,c_938]) ).
tff(c_988,plain,
op(e3,e3) = e0,
inference(negUnitSimplification,[status(thm)],[c_218,c_976]) ).
tff(c_578,plain,
( ( op(e0,e0) = e0 )
| ( op(e1,e1) = e1 )
| ( op(e1,e1) = e2 )
| ( op(e1,e1) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_659]) ).
tff(c_804,plain,
( ( op(e0,e0) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_226,c_226,c_578]) ).
tff(c_930,plain,
( ( op(e0,e0) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_222,c_804]) ).
tff(c_975,plain,
( ( op(e0,e0) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_220,c_930]) ).
tff(c_987,plain,
op(e0,e0) = e0,
inference(negUnitSimplification,[status(thm)],[c_218,c_975]) ).
tff(c_234,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 )
| ( op(e0,e0) != e0 ) ),
inference(cnfTransformation,[status(thm)],[f_659]) ).
tff(c_923,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 )
| ( op(e0,e0) != e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_234]) ).
tff(c_994,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_987,c_923]) ).
tff(c_1006,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_989,c_988,c_994]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : ALG039+1 : TPTP v8.1.2. Released v2.7.0.
% 0.11/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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:40:29 EDT 2023
% 0.15/0.36 % CPUTime :
% 7.24/2.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.24/2.83
% 7.24/2.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.24/2.86
% 7.24/2.86 Inference rules
% 7.24/2.86 ----------------------
% 7.24/2.86 #Ref : 0
% 7.24/2.86 #Sup : 0
% 7.24/2.86 #Fact : 0
% 7.24/2.86 #Define : 0
% 7.24/2.86 #Split : 0
% 7.24/2.86 #Chain : 0
% 7.24/2.86 #Close : 0
% 7.24/2.86
% 7.24/2.86 Ordering : KBO
% 7.24/2.86
% 7.24/2.86 Simplification rules
% 7.24/2.86 ----------------------
% 7.24/2.86 #Subsume : 300
% 7.24/2.86 #Demod : 277
% 7.24/2.86 #Tautology : 72
% 7.24/2.86 #SimpNegUnit : 65
% 7.24/2.86 #BackRed : 0
% 7.24/2.86
% 7.24/2.86 #Partial instantiations: 0
% 7.24/2.86 #Strategies tried : 1
% 7.24/2.86
% 7.24/2.86 Timing (in seconds)
% 7.24/2.86 ----------------------
% 7.24/2.86 Preprocessing : 0.74
% 7.24/2.86 Parsing : 0.35
% 7.24/2.87 CNF conversion : 0.05
% 7.24/2.87 Main loop : 0.93
% 7.24/2.87 Inferencing : 0.00
% 7.24/2.87 Reduction : 0.24
% 7.24/2.87 Demodulation : 0.14
% 7.24/2.87 BG Simplification : 0.06
% 7.24/2.87 Subsumption : 0.61
% 7.24/2.87 Abstraction : 0.03
% 7.24/2.87 MUC search : 0.00
% 7.24/2.87 Cooper : 0.00
% 7.24/2.87 Total : 1.72
% 7.24/2.87 Index Insertion : 0.00
% 7.24/2.87 Index Deletion : 0.00
% 7.24/2.87 Index Matching : 0.00
% 7.24/2.87 BG Taut test : 0.00
%------------------------------------------------------------------------------