TSTP Solution File: SET046-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET046-5 : 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 : n005.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 10:55:41 EDT 2023
% Result : Unsatisfiable 2.08s 1.59s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 26 ( 13 ~; 13 |; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > f > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff(f_41,axiom,
! [X] :
( element(f(X),X)
| element(X,a) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X] :
( element(X,f(X))
| element(X,a) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X,Y] :
( ~ element(X,a)
| ~ element(X,Y)
| ~ element(Y,X) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_4] :
( element(X_4,a)
| element(f(X_4),X_4) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_4,plain,
! [X_3] :
( element(X_3,a)
| element(X_3,f(X_3)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_9,plain,
! [Y_7,X_8] :
( ~ element(Y_7,X_8)
| ~ element(X_8,Y_7)
| ~ element(X_8,a) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_16,plain,
! [X_9] :
( ~ element(f(X_9),X_9)
| ~ element(f(X_9),a)
| element(X_9,a) ),
inference(resolution,[status(thm)],[c_4,c_9]) ).
tff(c_20,plain,
! [X_10] :
( ~ element(f(X_10),a)
| element(X_10,a) ),
inference(resolution,[status(thm)],[c_6,c_16]) ).
tff(c_25,plain,
element(a,a),
inference(resolution,[status(thm)],[c_6,c_20]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( ~ element(Y_2,X_1)
| ~ element(X_1,Y_2)
| ~ element(X_1,a) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_27,plain,
~ element(a,a),
inference(resolution,[status(thm)],[c_25,c_2]) ).
tff(c_31,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_25,c_27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET046-5 : 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.18/0.36 % Computer : n005.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 16:44:11 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.08/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.08/1.59
% 2.08/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/1.63
% 2.73/1.63 Inference rules
% 2.73/1.63 ----------------------
% 2.73/1.63 #Ref : 0
% 2.73/1.63 #Sup : 5
% 2.73/1.63 #Fact : 0
% 2.73/1.63 #Define : 0
% 2.73/1.63 #Split : 0
% 2.73/1.63 #Chain : 0
% 2.73/1.63 #Close : 0
% 2.73/1.63
% 2.73/1.63 Ordering : KBO
% 2.73/1.63
% 2.73/1.63 Simplification rules
% 2.73/1.63 ----------------------
% 2.73/1.63 #Subsume : 1
% 2.73/1.63 #Demod : 1
% 2.73/1.63 #Tautology : 1
% 2.73/1.63 #SimpNegUnit : 0
% 2.73/1.63 #BackRed : 0
% 2.73/1.63
% 2.73/1.63 #Partial instantiations: 0
% 2.73/1.63 #Strategies tried : 1
% 2.73/1.63
% 2.73/1.63 Timing (in seconds)
% 2.73/1.63 ----------------------
% 2.73/1.63 Preprocessing : 0.38
% 2.73/1.63 Parsing : 0.21
% 2.73/1.63 CNF conversion : 0.02
% 2.73/1.63 Main loop : 0.17
% 2.73/1.63 Inferencing : 0.08
% 2.73/1.63 Reduction : 0.02
% 2.73/1.63 Demodulation : 0.01
% 2.73/1.63 BG Simplification : 0.01
% 2.73/1.63 Subsumption : 0.05
% 2.73/1.63 Abstraction : 0.00
% 2.73/1.63 MUC search : 0.00
% 2.73/1.63 Cooper : 0.00
% 2.73/1.63 Total : 0.60
% 2.73/1.63 Index Insertion : 0.00
% 2.73/1.63 Index Deletion : 0.00
% 2.73/1.63 Index Matching : 0.00
% 2.73/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------