TSTP Solution File: SYN072-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.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 : n017.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 : Unsatisfiable 2.94s 1.98s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 22 unt; 6 typ; 0 def)
% Number of atoms : 46 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > e > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(d,type,
d: $i ).
tff(e,type,
e: $i ).
tff(c,type,
c: $i ).
tff(f_26,axiom,
big_p(a),
file(unknown,unknown) ).
tff(f_29,axiom,
a != b,
file(unknown,unknown) ).
tff(f_27,axiom,
big_p(b),
file(unknown,unknown) ).
tff(f_25,axiom,
! [X] :
( ( X = c )
| ( X = d ) ),
file(unknown,unknown) ).
tff(f_31,axiom,
~ big_p(e),
file(unknown,unknown) ).
tff(c_4,plain,
big_p(a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_8,plain,
b != a,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
big_p(b),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_36,plain,
( ( d = b )
| ( c = b ) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_17,plain,
! [X_2] :
( ( d = X_2 )
| ( c = X_2 ) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_37,plain,
! [X_2] :
( ( b = X_2 )
| ( c = X_2 )
| ( c = b ) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_17]) ).
tff(c_88,plain,
c = b,
inference(splitLeft,[status(thm)],[c_37]) ).
tff(c_2,plain,
! [X_1] :
( ( d = X_1 )
| ( c = X_1 ) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_10,plain,
~ big_p(e),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_29,plain,
( ~ big_p(d)
| ( e = c ) ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_10]) ).
tff(c_43,plain,
~ big_p(d),
inference(splitLeft,[status(thm)],[c_29]) ).
tff(c_45,plain,
! [X_13] :
( ~ big_p(X_13)
| ( c = X_13 ) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_43]) ).
tff(c_53,plain,
c = a,
inference(resolution,[status(thm)],[c_4,c_45]) ).
tff(c_52,plain,
c = b,
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_61,plain,
b = a,
inference(demodulation,[status(thm),theory(equality)],[c_53,c_52]) ).
tff(c_63,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_61]) ).
tff(c_64,plain,
e = c,
inference(splitRight,[status(thm)],[c_29]) ).
tff(c_66,plain,
~ big_p(c),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_10]) ).
tff(c_89,plain,
~ big_p(b),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_66]) ).
tff(c_95,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_89]) ).
tff(c_132,plain,
( ( b = a )
| ( c = a ) ),
inference(splitRight,[status(thm)],[c_37]) ).
tff(c_104,plain,
! [X_14] :
( ( b = X_14 )
| ( c = X_14 ) ),
inference(splitRight,[status(thm)],[c_37]) ).
tff(c_133,plain,
! [X_14] :
( ( b = X_14 )
| ( a = X_14 )
| ( b = a ) ),
inference(superposition,[status(thm),theory(equality)],[c_132,c_104]) ).
tff(c_150,plain,
! [X_15] :
( ( b = X_15 )
| ( a = X_15 ) ),
inference(negUnitSimplification,[status(thm)],[c_8,c_133]) ).
tff(c_97,plain,
c != b,
inference(splitRight,[status(thm)],[c_37]) ).
tff(c_184,plain,
c = a,
inference(superposition,[status(thm),theory(equality)],[c_150,c_97]) ).
tff(c_216,plain,
~ big_p(a),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_66]) ).
tff(c_220,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % 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.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu Aug 3 16:54:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 2.94/1.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.94/1.98
% 2.94/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.94/2.02
% 2.94/2.02 Inference rules
% 2.94/2.02 ----------------------
% 2.94/2.02 #Ref : 0
% 2.94/2.02 #Sup : 44
% 2.94/2.02 #Fact : 3
% 2.94/2.02 #Define : 0
% 2.94/2.02 #Split : 3
% 2.94/2.02 #Chain : 0
% 2.94/2.02 #Close : 0
% 2.94/2.02
% 2.94/2.02 Ordering : KBO
% 2.94/2.02
% 2.94/2.02 Simplification rules
% 2.94/2.02 ----------------------
% 2.94/2.02 #Subsume : 8
% 2.94/2.02 #Demod : 30
% 2.94/2.02 #Tautology : 26
% 2.94/2.02 #SimpNegUnit : 9
% 2.94/2.02 #BackRed : 16
% 2.94/2.02
% 2.94/2.02 #Partial instantiations: 84
% 2.94/2.02 #Strategies tried : 1
% 2.94/2.02
% 2.94/2.02 Timing (in seconds)
% 2.94/2.02 ----------------------
% 2.94/2.02 Preprocessing : 0.57
% 2.94/2.02 Parsing : 0.28
% 2.94/2.03 CNF conversion : 0.03
% 2.94/2.03 Main loop : 0.30
% 2.94/2.03 Inferencing : 0.12
% 2.94/2.03 Reduction : 0.08
% 2.94/2.03 Demodulation : 0.05
% 2.94/2.03 BG Simplification : 0.02
% 2.94/2.03 Subsumption : 0.06
% 2.94/2.03 Abstraction : 0.01
% 2.94/2.03 MUC search : 0.00
% 2.94/2.03 Cooper : 0.00
% 2.94/2.03 Total : 0.93
% 2.94/2.03 Index Insertion : 0.00
% 2.94/2.03 Index Deletion : 0.00
% 2.94/2.03 Index Matching : 0.00
% 2.94/2.03 BG Taut test : 0.00
%------------------------------------------------------------------------------