TSTP Solution File: SYN967+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN967+1 : TPTP v8.1.2. Released v3.1.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 : 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 11:17:00 EDT 2023
% Result : Theorem 2.31s 1.58s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 3 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 (; 6 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $i > $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_39,negated_conjecture,
~ ! [A,B] :
( ! [Y] :
( q(Y)
=> p(Y) )
=> ? [X] :
( ( p(X)
=> p(A) )
& ( q(X)
=> p(B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_10,plain,
! [X_4] :
( p(X_4)
| q(X_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
! [Y_6] :
( p(Y_6)
| ~ q(Y_6) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_16,plain,
! [X_4] : p(X_4),
inference(resolution,[status(thm)],[c_10,c_12]) ).
tff(c_4,plain,
( ~ p('#skF_1')
| ~ p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_26,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN967+1 : TPTP v8.1.2. Released v3.1.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.15/0.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 17:58:38 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.31/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.31/1.58
% 2.31/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.31/1.61
% 2.31/1.61 Inference rules
% 2.31/1.61 ----------------------
% 2.31/1.61 #Ref : 0
% 2.31/1.61 #Sup : 1
% 2.31/1.61 #Fact : 0
% 2.31/1.61 #Define : 0
% 2.31/1.61 #Split : 0
% 2.31/1.61 #Chain : 0
% 2.31/1.61 #Close : 0
% 2.31/1.61
% 2.31/1.61 Ordering : KBO
% 2.31/1.61
% 2.31/1.61 Simplification rules
% 2.31/1.61 ----------------------
% 2.31/1.61 #Subsume : 0
% 2.31/1.61 #Demod : 7
% 2.31/1.61 #Tautology : 3
% 2.31/1.61 #SimpNegUnit : 0
% 2.31/1.61 #BackRed : 0
% 2.31/1.61
% 2.31/1.61 #Partial instantiations: 0
% 2.31/1.61 #Strategies tried : 1
% 2.31/1.61
% 2.31/1.61 Timing (in seconds)
% 2.31/1.61 ----------------------
% 2.31/1.61 Preprocessing : 0.39
% 2.31/1.61 Parsing : 0.22
% 2.31/1.61 CNF conversion : 0.02
% 2.31/1.61 Main loop : 0.15
% 2.31/1.61 Inferencing : 0.08
% 2.31/1.61 Reduction : 0.02
% 2.31/1.61 Demodulation : 0.01
% 2.31/1.61 BG Simplification : 0.01
% 2.31/1.61 Subsumption : 0.03
% 2.31/1.61 Abstraction : 0.00
% 2.31/1.61 MUC search : 0.00
% 2.31/1.61 Cooper : 0.00
% 2.31/1.61 Total : 0.58
% 2.31/1.61 Index Insertion : 0.00
% 2.31/1.61 Index Deletion : 0.00
% 2.31/1.61 Index Matching : 0.00
% 2.31/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------