TSTP Solution File: SET043-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET043-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/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 : n027.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:40 EDT 2023
% Result : Unsatisfiable 2.49s 1.65s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 9 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 4 |; 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 : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(f_34,axiom,
! [X] :
( element(X,X)
| element(X,a) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X] :
( ~ element(X,a)
| ~ element(X,X) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] :
( element(X_2,a)
| element(X_2,X_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_17,plain,
element(a,a),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_21,plain,
! [X_4] :
( ~ element(X_4,X_4)
| ~ element(X_4,a) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_23,plain,
~ element(a,a),
inference(resolution,[status(thm)],[c_17,c_21]) ).
tff(c_30,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET043-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 17:23:09 EDT 2023
% 0.13/0.33 % CPUTime :
% 2.49/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.49/1.66
% 2.49/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.49/1.69
% 2.49/1.69 Inference rules
% 2.49/1.69 ----------------------
% 2.49/1.69 #Ref : 0
% 2.49/1.69 #Sup : 2
% 2.49/1.69 #Fact : 2
% 2.49/1.69 #Define : 0
% 2.49/1.69 #Split : 0
% 2.49/1.69 #Chain : 0
% 2.49/1.69 #Close : 0
% 2.49/1.69
% 2.49/1.69 Ordering : KBO
% 2.49/1.69
% 2.49/1.69 Simplification rules
% 2.49/1.69 ----------------------
% 2.49/1.69 #Subsume : 0
% 2.49/1.69 #Demod : 2
% 2.49/1.69 #Tautology : 1
% 2.49/1.69 #SimpNegUnit : 0
% 2.49/1.69 #BackRed : 0
% 2.49/1.69
% 2.49/1.69 #Partial instantiations: 0
% 2.49/1.69 #Strategies tried : 1
% 2.49/1.69
% 2.49/1.69 Timing (in seconds)
% 2.49/1.69 ----------------------
% 2.49/1.70 Preprocessing : 0.38
% 2.49/1.70 Parsing : 0.21
% 2.49/1.70 CNF conversion : 0.02
% 2.49/1.70 Main loop : 0.13
% 2.49/1.70 Inferencing : 0.07
% 2.49/1.70 Reduction : 0.02
% 2.49/1.70 Demodulation : 0.01
% 2.49/1.70 BG Simplification : 0.01
% 2.49/1.70 Subsumption : 0.03
% 2.49/1.70 Abstraction : 0.00
% 2.49/1.70 MUC search : 0.00
% 2.49/1.70 Cooper : 0.00
% 2.49/1.70 Total : 0.56
% 2.49/1.70 Index Insertion : 0.00
% 2.49/1.70 Index Deletion : 0.00
% 2.49/1.70 Index Matching : 0.00
% 2.49/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------