TSTP Solution File: SYN341+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN341+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 : n032.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:31 EDT 2023
% Result : Theorem 1.94s 1.47s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of formulae : 7 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 8 (; 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(big_f,type,
big_f: ( $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(f_32,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( big_f(X1,X2,X3)
=> big_f(X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_15_6) ).
tff(c_4,plain,
! [X1_1,X3_12] : big_f(X1_1,'#skF_1'(X1_1),X3_12),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_6,plain,
! [X1_16,X3_17] : ~ big_f('#skF_1'(X1_16),X3_17,'#skF_2'(X1_16,X3_17)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_11,plain,
$false,
inference(resolution,[status(thm)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN341+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.12/0.34 % Computer : n032.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 17:25:36 EDT 2023
% 0.12/0.34 % CPUTime :
% 1.94/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.94/1.47
% 1.94/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.24/1.51
% 2.24/1.51 Inference rules
% 2.24/1.51 ----------------------
% 2.24/1.51 #Ref : 0
% 2.24/1.51 #Sup : 1
% 2.24/1.51 #Fact : 0
% 2.24/1.51 #Define : 0
% 2.24/1.51 #Split : 0
% 2.24/1.51 #Chain : 0
% 2.24/1.51 #Close : 0
% 2.24/1.51
% 2.24/1.51 Ordering : KBO
% 2.24/1.51
% 2.24/1.51 Simplification rules
% 2.24/1.51 ----------------------
% 2.24/1.51 #Subsume : 0
% 2.24/1.51 #Demod : 0
% 2.24/1.51 #Tautology : 0
% 2.24/1.51 #SimpNegUnit : 0
% 2.24/1.51 #BackRed : 0
% 2.24/1.51
% 2.24/1.51 #Partial instantiations: 0
% 2.24/1.51 #Strategies tried : 1
% 2.24/1.51
% 2.24/1.51 Timing (in seconds)
% 2.24/1.51 ----------------------
% 2.24/1.51 Preprocessing : 0.37
% 2.24/1.51 Parsing : 0.20
% 2.24/1.51 CNF conversion : 0.02
% 2.24/1.51 Main loop : 0.10
% 2.24/1.51 Inferencing : 0.05
% 2.24/1.51 Reduction : 0.02
% 2.24/1.51 Demodulation : 0.02
% 2.24/1.51 BG Simplification : 0.01
% 2.24/1.51 Subsumption : 0.02
% 2.24/1.51 Abstraction : 0.00
% 2.24/1.51 MUC search : 0.00
% 2.24/1.51 Cooper : 0.00
% 2.24/1.51 Total : 0.53
% 2.24/1.52 Index Insertion : 0.00
% 2.24/1.52 Index Deletion : 0.00
% 2.24/1.52 Index Matching : 0.00
% 2.24/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------