TSTP Solution File: SYN323+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN323+1 : TPTP v8.1.2. Released v2.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 : n014.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:26 EDT 2023
% Result : Theorem 2.07s 1.54s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 16 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 15 (; 14 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_41,negated_conjecture,
~ ? [Y] :
( ! [X] :
( ( big_f(X,Y)
=> big_f(Y,X) )
=> big_g(X,Y) )
=> ~ ! [X] :
( ( big_f(X,Y)
=> big_f(Y,X) )
=> ~ big_g(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_4_2) ).
tff(c_15,plain,
! [X_10,Y_11] :
( big_f(X_10,Y_11)
| big_g(X_10,Y_11) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_8,plain,
! [X_4,Y_1] :
( big_f(X_4,Y_1)
| ~ big_g(X_4,Y_1) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_19,plain,
! [X_10,Y_11] : big_f(X_10,Y_11),
inference(resolution,[status(thm)],[c_15,c_8]) ).
tff(c_2,plain,
! [Y_1,X_5] :
( ~ big_f(Y_1,X_5)
| big_g(X_5,Y_1) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_22,plain,
! [X_5,Y_1] : big_g(X_5,Y_1),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_2]) ).
tff(c_6,plain,
! [Y_1,X_4] :
( ~ big_f(Y_1,X_4)
| ~ big_g(X_4,Y_1) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_19,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% 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.13/0.33 % Computer : n014.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:12:33 EDT 2023
% 0.13/0.33 % CPUTime :
% 2.07/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.07/1.54
% 2.07/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.07/1.57
% 2.07/1.57 Inference rules
% 2.07/1.57 ----------------------
% 2.07/1.57 #Ref : 0
% 2.07/1.57 #Sup : 2
% 2.07/1.57 #Fact : 0
% 2.07/1.57 #Define : 0
% 2.07/1.57 #Split : 0
% 2.07/1.57 #Chain : 0
% 2.07/1.57 #Close : 0
% 2.07/1.57
% 2.07/1.57 Ordering : KBO
% 2.07/1.57
% 2.07/1.57 Simplification rules
% 2.07/1.57 ----------------------
% 2.07/1.57 #Subsume : 0
% 2.07/1.57 #Demod : 5
% 2.07/1.57 #Tautology : 2
% 2.07/1.57 #SimpNegUnit : 0
% 2.07/1.57 #BackRed : 1
% 2.07/1.57
% 2.07/1.57 #Partial instantiations: 0
% 2.07/1.57 #Strategies tried : 1
% 2.07/1.57
% 2.07/1.57 Timing (in seconds)
% 2.07/1.57 ----------------------
% 2.07/1.57 Preprocessing : 0.39
% 2.07/1.57 Parsing : 0.21
% 2.07/1.57 CNF conversion : 0.02
% 2.07/1.57 Main loop : 0.15
% 2.07/1.57 Inferencing : 0.08
% 2.07/1.57 Reduction : 0.02
% 2.07/1.57 Demodulation : 0.01
% 2.07/1.57 BG Simplification : 0.01
% 2.07/1.57 Subsumption : 0.03
% 2.07/1.57 Abstraction : 0.00
% 2.07/1.57 MUC search : 0.00
% 2.07/1.57 Cooper : 0.00
% 2.07/1.57 Total : 0.58
% 2.07/1.57 Index Insertion : 0.00
% 2.07/1.57 Index Deletion : 0.00
% 2.07/1.57 Index Matching : 0.00
% 2.07/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------