TSTP Solution File: SYN367+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN367+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:39 EDT 2023
% Result : Theorem 2.55s 1.61s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 4 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > big_q > #nlpp > p > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(big_q,type,
big_q: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_r,type,
big_r: $i > $o ).
tff(f_41,negated_conjecture,
~ ( ! [X] :
( ( p
& big_q(X) )
| ( ~ p
& big_r(X) ) )
=> ( ! [X] : big_q(X)
| ! [X] : big_r(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2118) ).
tff(c_8,plain,
! [X_1] :
( p
| big_r(X_1) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_13,plain,
p,
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_10,plain,
! [X_1] :
( big_q(X_1)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_15,plain,
! [X_1] : big_q(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_10]) ).
tff(c_4,plain,
~ big_q('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_18,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15,c_4]) ).
tff(c_19,plain,
! [X_1] : big_r(X_1),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_2,plain,
~ big_r('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_23,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN367+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.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 17:05:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.55/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/1.61
% 2.55/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.55/1.65
% 2.55/1.65 Inference rules
% 2.55/1.65 ----------------------
% 2.55/1.65 #Ref : 0
% 2.55/1.65 #Sup : 0
% 2.55/1.65 #Fact : 0
% 2.55/1.65 #Define : 0
% 2.55/1.65 #Split : 1
% 2.55/1.65 #Chain : 0
% 2.55/1.65 #Close : 0
% 2.55/1.65
% 2.55/1.65 Ordering : KBO
% 2.55/1.65
% 2.55/1.65 Simplification rules
% 2.55/1.65 ----------------------
% 2.55/1.65 #Subsume : 0
% 2.55/1.65 #Demod : 3
% 2.55/1.65 #Tautology : 1
% 2.55/1.65 #SimpNegUnit : 0
% 2.55/1.65 #BackRed : 2
% 2.55/1.65
% 2.55/1.65 #Partial instantiations: 0
% 2.55/1.65 #Strategies tried : 1
% 2.55/1.65
% 2.55/1.65 Timing (in seconds)
% 2.55/1.65 ----------------------
% 2.55/1.65 Preprocessing : 0.40
% 2.55/1.65 Parsing : 0.23
% 2.55/1.65 CNF conversion : 0.02
% 2.55/1.65 Main loop : 0.10
% 2.55/1.65 Inferencing : 0.03
% 2.55/1.65 Reduction : 0.02
% 2.55/1.65 Demodulation : 0.02
% 2.55/1.65 BG Simplification : 0.01
% 2.55/1.65 Subsumption : 0.02
% 2.55/1.65 Abstraction : 0.00
% 2.55/1.65 MUC search : 0.00
% 2.55/1.65 Cooper : 0.00
% 2.55/1.65 Total : 0.56
% 2.55/1.66 Index Insertion : 0.00
% 2.55/1.66 Index Deletion : 0.00
% 2.55/1.66 Index Matching : 0.00
% 2.55/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------