TSTP Solution File: SYN071+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN071+1 : TPTP v8.1.2. Released v2.0.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 : n014.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 11:09:30 EDT 2023
% Result : Theorem 1.98s 1.53s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 22 ( 20 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(d,type,
d: $i ).
tff(c,type,
c: $i ).
tff(f_35,axiom,
( ( a = c )
| ( b = d ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel48_2) ).
tff(f_39,negated_conjecture,
~ ( ( a = d )
| ( b = c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel48) ).
tff(f_32,axiom,
( ( a = b )
| ( c = d ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel48_1) ).
tff(c_4,plain,
( ( d = b )
| ( c = a ) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_9,plain,
c = a,
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_6,plain,
c != b,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_10,plain,
b != a,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6]) ).
tff(c_8,plain,
d != a,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
( ( d = c )
| ( b = a ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_15,plain,
( ( d = a )
| ( b = a ) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_2]) ).
tff(c_16,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_8,c_15]) ).
tff(c_17,plain,
d = b,
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_19,plain,
b != a,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_8]) ).
tff(c_24,plain,
( ( c = b )
| ( b = a ) ),
inference(demodulation,[status(thm),theory(equality)],[c_17,c_2]) ).
tff(c_25,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_6,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN071+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:07:33 EDT 2023
% 0.13/0.36 % CPUTime :
% 1.98/1.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.98/1.53
% 1.98/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.98/1.56
% 1.98/1.56 Inference rules
% 1.98/1.56 ----------------------
% 1.98/1.56 #Ref : 0
% 1.98/1.56 #Sup : 4
% 1.98/1.56 #Fact : 0
% 1.98/1.56 #Define : 0
% 1.98/1.56 #Split : 1
% 1.98/1.56 #Chain : 0
% 1.98/1.56 #Close : 0
% 1.98/1.56
% 1.98/1.56 Ordering : KBO
% 1.98/1.56
% 1.98/1.56 Simplification rules
% 1.98/1.56 ----------------------
% 1.98/1.56 #Subsume : 0
% 1.98/1.56 #Demod : 4
% 1.98/1.56 #Tautology : 4
% 1.98/1.56 #SimpNegUnit : 2
% 1.98/1.56 #BackRed : 2
% 1.98/1.56
% 1.98/1.56 #Partial instantiations: 0
% 1.98/1.56 #Strategies tried : 1
% 1.98/1.56
% 1.98/1.56 Timing (in seconds)
% 1.98/1.56 ----------------------
% 1.98/1.56 Preprocessing : 0.38
% 1.98/1.56 Parsing : 0.21
% 1.98/1.56 CNF conversion : 0.01
% 1.98/1.56 Main loop : 0.12
% 2.35/1.56 Inferencing : 0.04
% 2.35/1.56 Reduction : 0.03
% 2.35/1.56 Demodulation : 0.02
% 2.35/1.56 BG Simplification : 0.01
% 2.35/1.56 Subsumption : 0.03
% 2.35/1.56 Abstraction : 0.00
% 2.35/1.56 MUC search : 0.00
% 2.35/1.56 Cooper : 0.00
% 2.35/1.56 Total : 0.55
% 2.35/1.56 Index Insertion : 0.00
% 2.35/1.56 Index Deletion : 0.00
% 2.35/1.56 Index Matching : 0.00
% 2.35/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------