TSTP Solution File: SYN333+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN333+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 : n007.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:29 EDT 2023
% Result : Theorem 2.01s 1.51s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 21 ( 9 ~; 6 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 13 (; 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_40,negated_conjecture,
~ ? [X,Y] :
! [Z] :
( big_f(X,Y)
=> ( big_f(Y,Z)
& big_f(Z,Z)
& ( ( big_f(X,Y)
& big_g(X,Y) )
=> ( big_g(X,Z)
& big_g(Z,Z) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_5) ).
tff(c_2,plain,
! [X_1,Y_2] : big_f(X_1,Y_2),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_6,plain,
! [X_1,Y_2] :
( big_g(X_1,Y_2)
| ~ big_f('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
| ~ big_f(Y_2,'#skF_1'(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_12,plain,
! [X_1,Y_2] : big_g(X_1,Y_2),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_6]) ).
tff(c_4,plain,
! [X_1,Y_2] :
( ~ big_g('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
| ~ big_g(X_1,'#skF_1'(X_1,Y_2))
| ~ big_f('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
| ~ big_f(Y_2,'#skF_1'(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_14,plain,
! [X_1,Y_2] :
( ~ big_g('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
| ~ big_g(X_1,'#skF_1'(X_1,Y_2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_4]) ).
tff(c_16,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_12,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN333+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:04:08 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.01/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.01/1.51
% 2.01/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.17/1.55
% 2.17/1.55 Inference rules
% 2.17/1.55 ----------------------
% 2.17/1.55 #Ref : 0
% 2.17/1.55 #Sup : 0
% 2.17/1.55 #Fact : 0
% 2.17/1.55 #Define : 0
% 2.17/1.55 #Split : 0
% 2.17/1.55 #Chain : 0
% 2.17/1.55 #Close : 0
% 2.17/1.55
% 2.17/1.55 Ordering : KBO
% 2.17/1.55
% 2.17/1.55 Simplification rules
% 2.17/1.55 ----------------------
% 2.17/1.55 #Subsume : 2
% 2.17/1.55 #Demod : 9
% 2.17/1.55 #Tautology : 1
% 2.17/1.55 #SimpNegUnit : 0
% 2.17/1.55 #BackRed : 0
% 2.17/1.55
% 2.17/1.55 #Partial instantiations: 0
% 2.17/1.55 #Strategies tried : 1
% 2.17/1.55
% 2.17/1.55 Timing (in seconds)
% 2.17/1.55 ----------------------
% 2.17/1.55 Preprocessing : 0.41
% 2.17/1.55 Parsing : 0.23
% 2.17/1.55 CNF conversion : 0.03
% 2.17/1.55 Main loop : 0.06
% 2.17/1.55 Inferencing : 0.00
% 2.17/1.55 Reduction : 0.02
% 2.17/1.55 Demodulation : 0.02
% 2.17/1.55 BG Simplification : 0.01
% 2.17/1.55 Subsumption : 0.03
% 2.17/1.55 Abstraction : 0.00
% 2.17/1.55 MUC search : 0.00
% 2.17/1.55 Cooper : 0.00
% 2.17/1.55 Total : 0.53
% 2.17/1.55 Index Insertion : 0.00
% 2.17/1.55 Index Deletion : 0.00
% 2.17/1.55 Index Matching : 0.00
% 2.17/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------