TSTP Solution File: SYN052-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN052-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/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 : n025.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:08 EDT 2023
% Result : Unsatisfiable 2.02s 1.52s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 18 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > p > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(a,type,
a: $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_40,axiom,
( ~ p
| ~ big_f(a) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X] :
( p
| ~ big_f(X) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [Y] :
( big_f(Y)
| p ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] :
( big_f(X)
| ~ p ),
file(unknown,unknown) ).
tff(c_8,plain,
( ~ big_f(a)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_11,plain,
~ p,
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_2,plain,
! [X_1] :
( ~ big_f(X_1)
| p ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_12,plain,
! [X_1] : ~ big_f(X_1),
inference(negUnitSimplification,[status(thm)],[c_11,c_2]) ).
tff(c_6,plain,
! [Y_3] :
( p
| big_f(Y_3) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_14,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_11,c_6]) ).
tff(c_16,plain,
p,
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_4,plain,
! [X_2] :
( ~ p
| big_f(X_2) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_19,plain,
! [X_2] : big_f(X_2),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_4]) ).
tff(c_15,plain,
~ big_f(a),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_22,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN052-1 : TPTP v8.1.2. Released v1.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 : n025.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.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 17:35:34 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.02/1.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.02/1.52
% 2.02/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.50/1.56
% 2.50/1.56 Inference rules
% 2.50/1.56 ----------------------
% 2.50/1.56 #Ref : 0
% 2.50/1.56 #Sup : 0
% 2.50/1.56 #Fact : 0
% 2.50/1.56 #Define : 0
% 2.50/1.56 #Split : 1
% 2.50/1.56 #Chain : 0
% 2.50/1.56 #Close : 0
% 2.50/1.56
% 2.50/1.56 Ordering : KBO
% 2.50/1.56
% 2.50/1.56 Simplification rules
% 2.50/1.56 ----------------------
% 2.50/1.56 #Subsume : 1
% 2.50/1.56 #Demod : 3
% 2.50/1.56 #Tautology : 1
% 2.50/1.56 #SimpNegUnit : 2
% 2.50/1.56 #BackRed : 1
% 2.50/1.56
% 2.50/1.56 #Partial instantiations: 0
% 2.50/1.56 #Strategies tried : 1
% 2.50/1.56
% 2.50/1.56 Timing (in seconds)
% 2.50/1.56 ----------------------
% 2.50/1.56 Preprocessing : 0.37
% 2.50/1.56 Parsing : 0.20
% 2.50/1.56 CNF conversion : 0.02
% 2.50/1.56 Main loop : 0.12
% 2.50/1.56 Inferencing : 0.03
% 2.50/1.56 Reduction : 0.02
% 2.50/1.56 Demodulation : 0.01
% 2.50/1.56 BG Simplification : 0.01
% 2.50/1.56 Subsumption : 0.03
% 2.50/1.56 Abstraction : 0.00
% 2.50/1.56 MUC search : 0.00
% 2.50/1.56 Cooper : 0.00
% 2.50/1.56 Total : 0.55
% 2.50/1.56 Index Insertion : 0.00
% 2.50/1.56 Index Deletion : 0.00
% 2.50/1.56 Index Matching : 0.00
% 2.50/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------