TSTP Solution File: ALG175+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG175+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n022.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:17 EDT 2023
% Result : Theorem 4.77s 2.04s
% Output : CNFRefutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 73 ( 72 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 73 ( 13 ~; 0 |; 60 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 52 ( 6 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_1155,axiom,
( ( e0 = op(op(e3,e1),e3) )
& ( e2 = op(e3,op(op(e3,e1),e3)) )
& ( e4 = op(e3,e1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
tff(f_1256,negated_conjecture,
~ ~ ( ( 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 )
& ( op(op(e0,e0),e0) = e0 )
& ( op(op(e0,e1),e1) = e0 )
& ( op(op(e0,e2),e2) = e0 )
& ( op(op(e0,e3),e3) = e0 )
& ( op(op(e0,e4),e4) = e0 )
& ( op(op(e1,e0),e0) = e1 )
& ( op(op(e1,e1),e1) = e1 )
& ( op(op(e1,e2),e2) = e1 )
& ( op(op(e1,e3),e3) = e1 )
& ( op(op(e1,e4),e4) = e1 )
& ( op(op(e2,e0),e0) = e2 )
& ( op(op(e2,e1),e1) = e2 )
& ( op(op(e2,e2),e2) = e2 )
& ( op(op(e2,e3),e3) = e2 )
& ( op(op(e2,e4),e4) = e2 )
& ( op(op(e3,e0),e0) = e3 )
& ( op(op(e3,e1),e1) = e3 )
& ( op(op(e3,e2),e2) = e3 )
& ( op(op(e3,e3),e3) = e3 )
& ( op(op(e3,e4),e4) = e3 )
& ( op(op(e4,e0),e0) = e4 )
& ( op(op(e4,e1),e1) = e4 )
& ( op(op(e4,e2),e2) = e4 )
& ( op(op(e4,e3),e3) = e4 )
& ( op(op(e4,e4),e4) = e4 ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax5) ).
tff(c_422,plain,
op(e3,e1) = e4,
inference(cnfTransformation,[status(thm)],[f_1155]) ).
tff(c_426,plain,
op(op(e3,e1),e3) = e0,
inference(cnfTransformation,[status(thm)],[f_1155]) ).
tff(c_549,plain,
op(e4,e3) = e0,
inference(demodulation,[status(thm),theory(equality)],[c_422,c_426]) ).
tff(c_444,plain,
op(op(e3,e1),e1) = e3,
inference(cnfTransformation,[status(thm)],[f_1256]) ).
tff(c_548,plain,
op(e4,e1) = e3,
inference(demodulation,[status(thm),theory(equality)],[c_422,c_444]) ).
tff(c_484,plain,
op(e4,op(e4,e1)) = e1,
inference(cnfTransformation,[status(thm)],[f_1256]) ).
tff(c_552,plain,
op(e4,e3) = e1,
inference(demodulation,[status(thm),theory(equality)],[c_548,c_484]) ).
tff(c_559,plain,
e1 = e0,
inference(demodulation,[status(thm),theory(equality)],[c_549,c_552]) ).
tff(c_420,plain,
e1 != e0,
inference(cnfTransformation,[status(thm)],[f_1150]) ).
tff(c_620,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_559,c_420]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ALG175+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 20:21:48 EDT 2023
% 0.15/0.35 % CPUTime :
% 4.77/2.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.77/2.04
% 4.77/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.77/2.07
% 4.77/2.07 Inference rules
% 4.77/2.07 ----------------------
% 4.77/2.07 #Ref : 0
% 4.77/2.07 #Sup : 0
% 4.77/2.07 #Fact : 0
% 4.77/2.07 #Define : 0
% 4.77/2.07 #Split : 0
% 4.77/2.07 #Chain : 0
% 4.77/2.07 #Close : 0
% 4.77/2.07
% 4.77/2.07 Ordering : KBO
% 4.77/2.07
% 4.77/2.07 Simplification rules
% 4.77/2.07 ----------------------
% 4.77/2.07 #Subsume : 223
% 4.77/2.07 #Demod : 144
% 4.77/2.07 #Tautology : 39
% 4.77/2.07 #SimpNegUnit : 0
% 4.77/2.07 #BackRed : 0
% 4.77/2.07
% 4.77/2.07 #Partial instantiations: 0
% 4.77/2.07 #Strategies tried : 1
% 4.77/2.07
% 4.77/2.07 Timing (in seconds)
% 4.77/2.07 ----------------------
% 4.77/2.07 Preprocessing : 0.83
% 4.77/2.07 Parsing : 0.44
% 4.77/2.07 CNF conversion : 0.04
% 4.77/2.07 Main loop : 0.20
% 4.77/2.07 Inferencing : 0.00
% 4.77/2.07 Reduction : 0.10
% 4.77/2.08 Demodulation : 0.08
% 4.77/2.08 BG Simplification : 0.06
% 4.77/2.08 Subsumption : 0.07
% 4.77/2.08 Abstraction : 0.02
% 4.77/2.08 MUC search : 0.00
% 4.77/2.08 Cooper : 0.00
% 4.77/2.08 Total : 1.07
% 4.77/2.08 Index Insertion : 0.00
% 4.77/2.08 Index Deletion : 0.00
% 4.77/2.08 Index Matching : 0.00
% 4.77/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------