TSTP Solution File: ALG017+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG017+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 : n006.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:52 EDT 2023
% Result : Theorem 7.44s 2.93s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 8 unt; 7 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ op > #nlpp > inv > 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(inv,type,
inv: $i > $i ).
tff(op,type,
op: ( $i * $i ) > $i ).
tff(unit,type,
unit: $i ).
tff(e3,type,
e3: $i ).
tff(f_597,axiom,
( ( e0 != e1 )
& ( e0 != e2 )
& ( e0 != e3 )
& ( e1 != e2 )
& ( e1 != e3 )
& ( e2 != e3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax10) ).
tff(f_600,axiom,
( ( e0 = op(e3,e3) )
& ( e1 = op(e2,e3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
tff(f_666,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_360,plain,
e3 != e0,
inference(cnfTransformation,[status(thm)],[f_597]) ).
tff(c_362,plain,
e2 != e0,
inference(cnfTransformation,[status(thm)],[f_597]) ).
tff(c_364,plain,
e1 != e0,
inference(cnfTransformation,[status(thm)],[f_597]) ).
tff(c_368,plain,
op(e3,e3) = e0,
inference(cnfTransformation,[status(thm)],[f_600]) ).
tff(c_382,plain,
( ( op(e1,e1) = e0 )
| ( op(e3,e3) = e1 )
| ( op(e3,e3) = e2 )
| ( op(e3,e3) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_1061,plain,
( ( op(e1,e1) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_382]) ).
tff(c_1072,plain,
( ( op(e1,e1) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_364,c_1061]) ).
tff(c_1119,plain,
( ( op(e1,e1) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_362,c_1072]) ).
tff(c_1130,plain,
op(e1,e1) = e0,
inference(negUnitSimplification,[status(thm)],[c_360,c_1119]) ).
tff(c_380,plain,
( ( op(e2,e2) = e0 )
| ( op(e3,e3) = e1 )
| ( op(e3,e3) = e2 )
| ( op(e3,e3) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_1062,plain,
( ( op(e2,e2) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_380]) ).
tff(c_1078,plain,
( ( op(e2,e2) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_364,c_1062]) ).
tff(c_1120,plain,
( ( op(e2,e2) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_362,c_1078]) ).
tff(c_1131,plain,
op(e2,e2) = e0,
inference(negUnitSimplification,[status(thm)],[c_360,c_1120]) ).
tff(c_384,plain,
( ( op(e0,e0) = e0 )
| ( op(e3,e3) = e1 )
| ( op(e3,e3) = e2 )
| ( op(e3,e3) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_1060,plain,
( ( op(e0,e0) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_368,c_368,c_368,c_384]) ).
tff(c_1069,plain,
( ( op(e0,e0) = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_364,c_1060]) ).
tff(c_1117,plain,
( ( op(e0,e0) = e0 )
| ( e3 = e0 ) ),
inference(negUnitSimplification,[status(thm)],[c_362,c_1069]) ).
tff(c_1129,plain,
op(e0,e0) = e0,
inference(negUnitSimplification,[status(thm)],[c_360,c_1117]) ).
tff(c_376,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 )
| ( op(e0,e0) != e0 ) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_1065,plain,
( ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 )
| ( op(e0,e0) != e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_368,c_376]) ).
tff(c_1135,plain,
( ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1129,c_1065]) ).
tff(c_1144,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1130,c_1131,c_1135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG017+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.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 3 20:22:43 EDT 2023
% 0.11/0.33 % CPUTime :
% 7.44/2.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.44/2.94
% 7.44/2.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.71/2.99
% 7.71/2.99 Inference rules
% 7.71/2.99 ----------------------
% 7.71/2.99 #Ref : 0
% 7.71/2.99 #Sup : 0
% 7.71/2.99 #Fact : 0
% 7.71/2.99 #Define : 0
% 7.71/2.99 #Split : 0
% 7.71/2.99 #Chain : 0
% 7.71/2.99 #Close : 0
% 7.71/2.99
% 7.71/2.99 Ordering : KBO
% 7.71/2.99
% 7.71/2.99 Simplification rules
% 7.71/2.99 ----------------------
% 7.71/2.99 #Subsume : 369
% 7.71/2.99 #Demod : 275
% 7.71/2.99 #Tautology : 74
% 7.71/2.99 #SimpNegUnit : 63
% 7.71/2.99 #BackRed : 0
% 7.71/2.99
% 7.71/2.99 #Partial instantiations: 0
% 7.71/2.99 #Strategies tried : 1
% 7.71/2.99
% 7.71/2.99 Timing (in seconds)
% 7.71/2.99 ----------------------
% 7.71/2.99 Preprocessing : 0.80
% 7.71/2.99 Parsing : 0.39
% 7.71/2.99 CNF conversion : 0.05
% 7.71/2.99 Main loop : 0.98
% 7.71/2.99 Inferencing : 0.00
% 7.71/2.99 Reduction : 0.25
% 7.71/2.99 Demodulation : 0.14
% 7.71/2.99 BG Simplification : 0.06
% 7.71/2.99 Subsumption : 0.63
% 7.71/3.00 Abstraction : 0.03
% 7.71/3.00 MUC search : 0.00
% 7.71/3.00 Cooper : 0.00
% 7.71/3.00 Total : 1.86
% 7.71/3.00 Index Insertion : 0.00
% 7.71/3.00 Index Deletion : 0.00
% 7.71/3.00 Index Matching : 0.00
% 7.71/3.00 BG Taut test : 0.00
%------------------------------------------------------------------------------