TSTP Solution File: SWV001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV001-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 : n028.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:02:37 EDT 2023
% Result : Unsatisfiable 3.69s 1.95s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 41 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 36 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 6 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 (; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q4 > q3 > q2 > q1 > less_or_equalish > equalish > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_or_equalish,type,
less_or_equalish: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(q2,type,
q2: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(q4,type,
q4: ( $i * $i * $i ) > $o ).
tff(q1,type,
q1: ( $i * $i * $i ) > $o ).
tff(q3,type,
q3: ( $i * $i * $i ) > $o ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_92,axiom,
q1(a,b,c),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y,Z] :
( ~ q1(X,Y,Z)
| ~ less_or_equalish(X,Y)
| q2(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y,Z] :
( ~ q2(X,Y,Z)
| q4(X,Y,Y) ),
file(unknown,unknown) ).
tff(f_86,axiom,
! [X,Y] :
( less_or_equalish(X,Y)
| less_or_equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] : less_or_equalish(X,X),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y,Z] :
( ~ q1(X,Y,Z)
| less_or_equalish(X,Y)
| q3(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X,Y,Z] :
( ~ q3(X,Y,Z)
| q4(X,Y,X) ),
file(unknown,unknown) ).
tff(f_104,axiom,
! [W] :
( ~ q4(a,b,W)
| ~ less_or_equalish(a,W)
| ~ less_or_equalish(b,W)
| ~ less_or_equalish(W,a) ),
file(unknown,unknown) ).
tff(f_116,axiom,
! [W] :
( ~ q4(a,b,W)
| ~ less_or_equalish(a,W)
| ~ less_or_equalish(b,W)
| ~ less_or_equalish(W,b) ),
file(unknown,unknown) ).
tff(c_24,plain,
q1(a,b,c),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_178,plain,
! [X_75,Y_76,Z_77] :
( q2(X_75,Y_76,Z_77)
| ~ less_or_equalish(X_75,Y_76)
| ~ q1(X_75,Y_76,Z_77) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_10,plain,
! [X_13,Y_14,Z_15] :
( q4(X_13,Y_14,Y_14)
| ~ q2(X_13,Y_14,Z_15) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_323,plain,
! [X_101,Y_102,Z_103] :
( q4(X_101,Y_102,Y_102)
| ~ less_or_equalish(X_101,Y_102)
| ~ q1(X_101,Y_102,Z_103) ),
inference(resolution,[status(thm)],[c_178,c_10]) ).
tff(c_326,plain,
( q4(a,b,b)
| ~ less_or_equalish(a,b) ),
inference(resolution,[status(thm)],[c_24,c_323]) ).
tff(c_327,plain,
~ less_or_equalish(a,b),
inference(splitLeft,[status(thm)],[c_326]) ).
tff(c_20,plain,
! [Y_26,X_25] :
( less_or_equalish(Y_26,X_25)
| less_or_equalish(X_25,Y_26) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_14,plain,
! [X_19] : less_or_equalish(X_19,X_19),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_150,plain,
! [X_63,Y_64,Z_65] :
( q3(X_63,Y_64,Z_65)
| less_or_equalish(X_63,Y_64)
| ~ q1(X_63,Y_64,Z_65) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_12,plain,
! [X_16,Y_17,Z_18] :
( q4(X_16,Y_17,X_16)
| ~ q3(X_16,Y_17,Z_18) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_341,plain,
! [X_104,Y_105,Z_106] :
( q4(X_104,Y_105,X_104)
| less_or_equalish(X_104,Y_105)
| ~ q1(X_104,Y_105,Z_106) ),
inference(resolution,[status(thm)],[c_150,c_12]) ).
tff(c_343,plain,
( q4(a,b,a)
| less_or_equalish(a,b) ),
inference(resolution,[status(thm)],[c_24,c_341]) ).
tff(c_346,plain,
q4(a,b,a),
inference(negUnitSimplification,[status(thm)],[c_327,c_343]) ).
tff(c_26,plain,
! [W_29] :
( ~ less_or_equalish(W_29,a)
| ~ less_or_equalish(b,W_29)
| ~ less_or_equalish(a,W_29)
| ~ q4(a,b,W_29) ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_352,plain,
( ~ less_or_equalish(b,a)
| ~ less_or_equalish(a,a) ),
inference(resolution,[status(thm)],[c_346,c_26]) ).
tff(c_358,plain,
~ less_or_equalish(b,a),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_352]) ).
tff(c_373,plain,
less_or_equalish(a,b),
inference(resolution,[status(thm)],[c_20,c_358]) ).
tff(c_387,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_327,c_373]) ).
tff(c_389,plain,
less_or_equalish(a,b),
inference(splitRight,[status(thm)],[c_326]) ).
tff(c_388,plain,
q4(a,b,b),
inference(splitRight,[status(thm)],[c_326]) ).
tff(c_28,plain,
! [W_30] :
( ~ less_or_equalish(W_30,b)
| ~ less_or_equalish(b,W_30)
| ~ less_or_equalish(a,W_30)
| ~ q4(a,b,W_30) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_415,plain,
( ~ less_or_equalish(b,b)
| ~ less_or_equalish(a,b) ),
inference(resolution,[status(thm)],[c_388,c_28]) ).
tff(c_422,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_389,c_14,c_415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV001-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/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.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:52:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.69/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.69/1.95
% 3.69/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.69/1.99
% 3.69/1.99 Inference rules
% 3.69/1.99 ----------------------
% 3.69/1.99 #Ref : 0
% 3.69/1.99 #Sup : 86
% 3.69/1.99 #Fact : 8
% 3.69/1.99 #Define : 0
% 3.69/1.99 #Split : 1
% 3.69/1.99 #Chain : 0
% 3.69/1.99 #Close : 0
% 3.69/1.99
% 3.69/1.99 Ordering : KBO
% 3.69/1.99
% 3.69/1.99 Simplification rules
% 3.69/1.99 ----------------------
% 3.69/1.99 #Subsume : 27
% 3.69/1.99 #Demod : 17
% 3.69/1.99 #Tautology : 16
% 3.69/1.99 #SimpNegUnit : 2
% 3.69/1.99 #BackRed : 0
% 3.69/1.99
% 3.69/1.99 #Partial instantiations: 0
% 3.69/1.99 #Strategies tried : 1
% 3.69/1.99
% 3.69/1.99 Timing (in seconds)
% 3.69/1.99 ----------------------
% 3.69/1.99 Preprocessing : 0.44
% 3.69/1.99 Parsing : 0.24
% 3.69/1.99 CNF conversion : 0.02
% 3.69/1.99 Main loop : 0.41
% 3.69/1.99 Inferencing : 0.18
% 3.69/1.99 Reduction : 0.08
% 3.69/1.99 Demodulation : 0.06
% 3.69/1.99 BG Simplification : 0.02
% 3.69/1.99 Subsumption : 0.11
% 3.69/1.99 Abstraction : 0.01
% 3.69/1.99 MUC search : 0.00
% 3.69/1.99 Cooper : 0.00
% 3.69/1.99 Total : 0.90
% 3.69/1.99 Index Insertion : 0.00
% 3.69/1.99 Index Deletion : 0.00
% 3.69/1.99 Index Matching : 0.00
% 3.69/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------