TSTP Solution File: ALG014+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG014+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 : n018.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:49 EDT 2023
% Result : Theorem 6.79s 2.68s
% Output : CNFRefutation 6.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 115 ( 114 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 106 ( 18 ~; 48 |; 40 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 3 ( 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_598,axiom,
( ( e0 != e1 )
& ( e0 != e2 )
& ( e0 != e3 )
& ( e1 != e2 )
& ( e1 != e3 )
& ( e2 != e3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
tff(f_350,axiom,
unit = e0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
tff(f_351,axiom,
inv(unit) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
tff(f_349,axiom,
( ( op(e0,inv(e0)) = unit )
& ( op(inv(e0),e0) = unit )
& ( op(e1,inv(e1)) = unit )
& ( op(inv(e1),e1) = unit )
& ( op(e2,inv(e2)) = unit )
& ( op(inv(e2),e2) = unit )
& ( op(e3,inv(e3)) = unit )
& ( op(inv(e3),e3) = unit )
& ( ( inv(e0) = e0 )
| ( inv(e0) = e1 )
| ( inv(e0) = e2 )
| ( inv(e0) = e3 ) )
& ( ( inv(e1) = e0 )
| ( inv(e1) = e1 )
| ( inv(e1) = e2 )
| ( inv(e1) = e3 ) )
& ( ( inv(e2) = e0 )
| ( inv(e2) = e1 )
| ( inv(e2) = e2 )
| ( inv(e2) = e3 ) )
& ( ( inv(e3) = e0 )
| ( inv(e3) = e1 )
| ( inv(e3) = e2 )
| ( inv(e3) = e3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(f_663,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_362,plain,
e3 != e0,
inference(cnfTransformation,[status(thm)],[f_598]) ).
tff(c_364,plain,
e2 != e0,
inference(cnfTransformation,[status(thm)],[f_598]) ).
tff(c_366,plain,
e1 != e0,
inference(cnfTransformation,[status(thm)],[f_598]) ).
tff(c_204,plain,
unit = e0,
inference(cnfTransformation,[status(thm)],[f_350]) ).
tff(c_206,plain,
inv(unit) = unit,
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_887,plain,
inv(e0) = e0,
inference(demodulation,[status(thm),theory(equality)],[c_204,c_204,c_206]) ).
tff(c_202,plain,
op(e0,inv(e0)) = unit,
inference(cnfTransformation,[status(thm)],[f_349]) ).
tff(c_904,plain,
op(e0,e0) = e0,
inference(demodulation,[status(thm),theory(equality)],[c_887,c_204,c_202]) ).
tff(c_880,plain,
( ( op(e3,e3) = e0 )
| ( op(e0,e0) = e1 )
| ( op(e0,e0) = e2 )
| ( op(e0,e0) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_663]) ).
tff(c_916,plain,
( ( op(e3,e3) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_904,c_904,c_904,c_880]) ).
tff(c_1099,plain,
op(e3,e3) = e0,
inference(negUnitSimplification,[status(thm)],[c_362,c_364,c_366,c_916]) ).
tff(c_788,plain,
( ( op(e1,e1) = e0 )
| ( op(e0,e0) = e1 )
| ( op(e3,e3) = e2 )
| ( op(e0,e0) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_663]) ).
tff(c_920,plain,
( ( op(e1,e1) = e0 )
| ( e1 = e0 )
| ( op(e3,e3) = e2 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_904,c_904,c_788]) ).
tff(c_1148,plain,
( ( op(e1,e1) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1099,c_920]) ).
tff(c_1149,plain,
op(e1,e1) = e0,
inference(negUnitSimplification,[status(thm)],[c_362,c_364,c_366,c_1148]) ).
tff(c_786,plain,
( ( op(e2,e2) = e0 )
| ( op(e0,e0) = e1 )
| ( op(e3,e3) = e2 )
| ( op(e0,e0) = e3 ) ),
inference(cnfTransformation,[status(thm)],[f_663]) ).
tff(c_921,plain,
( ( op(e2,e2) = e0 )
| ( e1 = e0 )
| ( op(e3,e3) = e2 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_904,c_904,c_786]) ).
tff(c_1166,plain,
( ( op(e2,e2) = e0 )
| ( e1 = e0 )
| ( e2 = e0 )
| ( e3 = e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1099,c_921]) ).
tff(c_1167,plain,
op(e2,e2) = e0,
inference(negUnitSimplification,[status(thm)],[c_362,c_364,c_366,c_1166]) ).
tff(c_374,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 )
| ( op(e0,e0) != e0 ) ),
inference(cnfTransformation,[status(thm)],[f_663]) ).
tff(c_1022,plain,
( ( op(e3,e3) != e0 )
| ( op(e2,e2) != e0 )
| ( op(e1,e1) != e0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_904,c_374]) ).
tff(c_1278,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1149,c_1167,c_1099,c_1022]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ALG014+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.15 % 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.20/0.37 % Computer : n018.cluster.edu
% 0.20/0.37 % Model : x86_64 x86_64
% 0.20/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.37 % Memory : 8042.1875MB
% 0.20/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.37 % CPULimit : 300
% 0.20/0.37 % WCLimit : 300
% 0.20/0.37 % DateTime : Thu Aug 3 20:24:36 EDT 2023
% 0.20/0.38 % CPUTime :
% 6.79/2.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.79/2.68
% 6.79/2.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.79/2.71
% 6.79/2.71 Inference rules
% 6.79/2.71 ----------------------
% 6.79/2.71 #Ref : 0
% 6.79/2.71 #Sup : 0
% 6.79/2.71 #Fact : 0
% 6.79/2.71 #Define : 0
% 6.79/2.71 #Split : 0
% 6.79/2.71 #Chain : 0
% 6.79/2.71 #Close : 0
% 6.79/2.71
% 6.79/2.71 Ordering : KBO
% 6.79/2.71
% 6.79/2.71 Simplification rules
% 6.79/2.71 ----------------------
% 6.79/2.71 #Subsume : 288
% 6.79/2.71 #Demod : 541
% 6.79/2.71 #Tautology : 154
% 6.79/2.71 #SimpNegUnit : 69
% 6.79/2.71 #BackRed : 0
% 6.79/2.71
% 6.79/2.71 #Partial instantiations: 0
% 6.79/2.71 #Strategies tried : 1
% 6.79/2.71
% 6.79/2.71 Timing (in seconds)
% 6.79/2.71 ----------------------
% 6.79/2.71 Preprocessing : 0.77
% 6.79/2.72 Parsing : 0.37
% 6.79/2.72 CNF conversion : 0.05
% 6.79/2.72 Main loop : 0.83
% 6.79/2.72 Inferencing : 0.00
% 6.79/2.72 Reduction : 0.30
% 6.79/2.72 Demodulation : 0.16
% 6.79/2.72 BG Simplification : 0.07
% 6.79/2.72 Subsumption : 0.45
% 6.79/2.72 Abstraction : 0.02
% 6.79/2.72 MUC search : 0.00
% 6.79/2.72 Cooper : 0.00
% 6.79/2.72 Total : 1.65
% 6.79/2.72 Index Insertion : 0.00
% 6.79/2.72 Index Deletion : 0.00
% 6.79/2.72 Index Matching : 0.00
% 6.79/2.72 BG Taut test : 0.00
%------------------------------------------------------------------------------