TSTP Solution File: SYN347-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN347-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 11:10:33 EDT 2023
% Result : Unsatisfiable 2.94s 1.73s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 23 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > y > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(y,type,
y: ( $i * $i ) > $i ).
tff(f_61,axiom,
! [X1,X2] :
( f(a,y(X1,X2))
| f(b,y(X1,X2)) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X1,X2] :
( ~ f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| f(a,b) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X1,X2] :
( f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| ~ f(a,b) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X1,X2] :
( ~ f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| ~ f(a,b) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X1,X2] :
( f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| f(a,b) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X1,X2] :
( ~ f(a,y(X1,X2))
| ~ f(b,y(X1,X2)) ),
file(unknown,unknown) ).
tff(c_10,plain,
! [X1_9,X2_10] :
( f(b,y(X1_9,X2_10))
| f(a,y(X1_9,X2_10)) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_4,plain,
! [X2_4,X1_3] :
( f(a,b)
| f(X2_4,y(X1_3,X2_4))
| ~ f(X1_3,y(X1_3,X2_4)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_19,plain,
f(a,b),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_8,plain,
! [X2_8,X1_7] :
( ~ f(a,b)
| f(X2_8,y(X1_7,X2_8))
| f(X1_7,y(X1_7,X2_8)) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_22,plain,
! [X2_8,X1_7] :
( f(X2_8,y(X1_7,X2_8))
| f(X1_7,y(X1_7,X2_8)) ),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_8]) ).
tff(c_35,plain,
! [X2_8] : f(X2_8,y(X2_8,X2_8)),
inference(factorization,[status(thm),theory(equality)],[c_22]) ).
tff(c_6,plain,
! [X2_6,X1_5] :
( ~ f(a,b)
| ~ f(X2_6,y(X1_5,X2_6))
| ~ f(X1_5,y(X1_5,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_57,plain,
! [X2_20,X1_21] :
( ~ f(X2_20,y(X1_21,X2_20))
| ~ f(X1_21,y(X1_21,X2_20)) ),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_6]) ).
tff(c_59,plain,
! [X2_8] : ~ f(X2_8,y(X2_8,X2_8)),
inference(resolution,[status(thm)],[c_35,c_57]) ).
tff(c_69,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_35,c_59]) ).
tff(c_72,plain,
! [X2_22,X1_23] :
( f(X2_22,y(X1_23,X2_22))
| ~ f(X1_23,y(X1_23,X2_22)) ),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_76,plain,
! [X2_10] :
( f(X2_10,y(b,X2_10))
| f(a,y(b,X2_10)) ),
inference(resolution,[status(thm)],[c_10,c_72]) ).
tff(c_89,plain,
f(a,y(b,a)),
inference(factorization,[status(thm),theory(equality)],[c_76]) ).
tff(c_71,plain,
~ f(a,b),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_2,plain,
! [X2_2,X1_1] :
( f(a,b)
| ~ f(X2_2,y(X1_1,X2_2))
| f(X1_1,y(X1_1,X2_2)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_103,plain,
! [X2_25,X1_26] :
( ~ f(X2_25,y(X1_26,X2_25))
| f(X1_26,y(X1_26,X2_25)) ),
inference(negUnitSimplification,[status(thm)],[c_71,c_2]) ).
tff(c_112,plain,
f(b,y(b,a)),
inference(resolution,[status(thm)],[c_89,c_103]) ).
tff(c_12,plain,
! [X1_11,X2_12] :
( ~ f(b,y(X1_11,X2_12))
| ~ f(a,y(X1_11,X2_12)) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_119,plain,
~ f(a,y(b,a)),
inference(resolution,[status(thm)],[c_112,c_12]) ).
tff(c_125,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_89,c_119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN347-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:17:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.94/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/1.74
% 2.94/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.98/1.77
% 2.98/1.77 Inference rules
% 2.98/1.77 ----------------------
% 2.98/1.77 #Ref : 0
% 2.98/1.77 #Sup : 15
% 2.98/1.77 #Fact : 4
% 2.98/1.77 #Define : 0
% 2.98/1.77 #Split : 1
% 2.98/1.77 #Chain : 0
% 2.98/1.77 #Close : 0
% 2.98/1.77
% 2.98/1.77 Ordering : KBO
% 2.98/1.77
% 2.98/1.77 Simplification rules
% 2.98/1.77 ----------------------
% 2.98/1.77 #Subsume : 2
% 2.98/1.77 #Demod : 8
% 2.98/1.77 #Tautology : 6
% 2.98/1.77 #SimpNegUnit : 1
% 2.98/1.77 #BackRed : 0
% 2.98/1.77
% 2.98/1.77 #Partial instantiations: 0
% 2.98/1.77 #Strategies tried : 1
% 2.98/1.77
% 2.98/1.77 Timing (in seconds)
% 2.98/1.77 ----------------------
% 2.98/1.77 Preprocessing : 0.42
% 2.98/1.77 Parsing : 0.23
% 2.98/1.77 CNF conversion : 0.02
% 2.98/1.77 Main loop : 0.22
% 2.98/1.77 Inferencing : 0.11
% 2.98/1.77 Reduction : 0.04
% 2.98/1.77 Demodulation : 0.02
% 2.98/1.77 BG Simplification : 0.02
% 2.98/1.77 Subsumption : 0.05
% 2.98/1.77 Abstraction : 0.01
% 2.98/1.77 MUC search : 0.00
% 2.98/1.77 Cooper : 0.00
% 2.98/1.77 Total : 0.69
% 2.98/1.77 Index Insertion : 0.00
% 2.98/1.77 Index Deletion : 0.00
% 2.98/1.77 Index Matching : 0.00
% 2.98/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------