TSTP Solution File: SYN079-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN079-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 : n031.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:32 EDT 2023
% Result : Unsatisfiable 2.51s 1.65s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > f > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_33,axiom,
~ big_f(f(a,b),f(a,c)),
file(unknown,unknown) ).
tff(f_22,axiom,
big_f(f(a,b),f(b,c)),
file(unknown,unknown) ).
tff(f_23,axiom,
big_f(f(b,c),f(a,c)),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y,Z] :
( ~ big_f(X,Y)
| ~ big_f(Y,Z)
| big_f(X,Z) ),
file(unknown,unknown) ).
tff(c_8,plain,
~ big_f(f(a,b),f(a,c)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
big_f(f(a,b),f(b,c)),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_4,plain,
big_f(f(b,c),f(a,c)),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_9,plain,
! [X_4,Z_5,Y_6] :
( big_f(X_4,Z_5)
| ~ big_f(Y_6,Z_5)
| ~ big_f(X_4,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_16,plain,
! [X_7] :
( big_f(X_7,f(a,c))
| ~ big_f(X_7,f(b,c)) ),
inference(resolution,[status(thm)],[c_4,c_9]) ).
tff(c_19,plain,
big_f(f(a,b),f(a,c)),
inference(resolution,[status(thm)],[c_2,c_16]) ).
tff(c_23,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN079-1 : TPTP v8.1.2. Released v1.0.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.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:52:44 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.51/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.59/1.66
% 2.59/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.59/1.68
% 2.59/1.68 Inference rules
% 2.59/1.68 ----------------------
% 2.59/1.68 #Ref : 0
% 2.59/1.68 #Sup : 3
% 2.59/1.68 #Fact : 0
% 2.59/1.68 #Define : 0
% 2.59/1.68 #Split : 0
% 2.59/1.68 #Chain : 0
% 2.59/1.68 #Close : 0
% 2.59/1.68
% 2.59/1.68 Ordering : KBO
% 2.59/1.68
% 2.59/1.68 Simplification rules
% 2.59/1.68 ----------------------
% 2.59/1.68 #Subsume : 0
% 2.59/1.68 #Demod : 0
% 2.59/1.68 #Tautology : 0
% 2.59/1.68 #SimpNegUnit : 1
% 2.59/1.68 #BackRed : 0
% 2.59/1.68
% 2.59/1.68 #Partial instantiations: 0
% 2.59/1.68 #Strategies tried : 1
% 2.59/1.68
% 2.59/1.68 Timing (in seconds)
% 2.59/1.68 ----------------------
% 2.59/1.68 Preprocessing : 0.38
% 2.59/1.69 Parsing : 0.21
% 2.59/1.69 CNF conversion : 0.02
% 2.59/1.69 Main loop : 0.14
% 2.59/1.69 Inferencing : 0.07
% 2.59/1.69 Reduction : 0.03
% 2.59/1.69 Demodulation : 0.02
% 2.59/1.69 BG Simplification : 0.01
% 2.59/1.69 Subsumption : 0.03
% 2.59/1.69 Abstraction : 0.00
% 2.59/1.69 MUC search : 0.00
% 2.59/1.69 Cooper : 0.00
% 2.59/1.69 Total : 0.57
% 2.59/1.69 Index Insertion : 0.00
% 2.59/1.69 Index Deletion : 0.00
% 2.59/1.69 Index Matching : 0.00
% 2.59/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------