TSTP Solution File: SYN358+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN358+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n010.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:37 EDT 2023
% Result : Theorem 2.23s 1.55s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 4 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 (; 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ 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(f_35,negated_conjecture,
~ ( ? [X] :
( p
& big_q(X) )
<=> ( p
& ? [X] : big_q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2109) ).
tff(c_18,plain,
p,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_2,plain,
! [X_1,X_2] :
( ~ big_q(X_1)
| ~ big_q(X_2)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_26,plain,
! [X_1,X_2] :
( ~ big_q(X_1)
| ~ big_q(X_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_2]) ).
tff(c_27,plain,
! [X_2] : ~ big_q(X_2),
inference(splitLeft,[status(thm)],[c_26]) ).
tff(c_10,plain,
( big_q('#skF_1')
| big_q('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_29,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_27,c_27,c_10]) ).
tff(c_30,plain,
! [X_1] : ~ big_q(X_1),
inference(splitRight,[status(thm)],[c_26]) ).
tff(c_32,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_30,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN358+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:12:58 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.23/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.23/1.56
% 2.23/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.23/1.59
% 2.23/1.59 Inference rules
% 2.23/1.59 ----------------------
% 2.23/1.59 #Ref : 0
% 2.23/1.59 #Sup : 0
% 2.23/1.59 #Fact : 0
% 2.23/1.59 #Define : 0
% 2.23/1.59 #Split : 1
% 2.23/1.59 #Chain : 0
% 2.23/1.59 #Close : 0
% 2.23/1.59
% 2.23/1.59 Ordering : KBO
% 2.23/1.59
% 2.23/1.59 Simplification rules
% 2.23/1.59 ----------------------
% 2.23/1.59 #Subsume : 0
% 2.23/1.59 #Demod : 5
% 2.23/1.59 #Tautology : 4
% 2.23/1.59 #SimpNegUnit : 2
% 2.23/1.59 #BackRed : 0
% 2.23/1.59
% 2.23/1.59 #Partial instantiations: 0
% 2.23/1.59 #Strategies tried : 1
% 2.23/1.59
% 2.23/1.59 Timing (in seconds)
% 2.23/1.59 ----------------------
% 2.23/1.60 Preprocessing : 0.39
% 2.23/1.60 Parsing : 0.21
% 2.23/1.60 CNF conversion : 0.02
% 2.23/1.60 Main loop : 0.12
% 2.23/1.60 Inferencing : 0.03
% 2.23/1.60 Reduction : 0.03
% 2.23/1.60 Demodulation : 0.02
% 2.23/1.60 BG Simplification : 0.01
% 2.23/1.60 Subsumption : 0.03
% 2.23/1.60 Abstraction : 0.00
% 2.23/1.60 MUC search : 0.00
% 2.23/1.60 Cooper : 0.00
% 2.23/1.60 Total : 0.56
% 2.23/1.60 Index Insertion : 0.00
% 2.23/1.60 Index Deletion : 0.00
% 2.23/1.60 Index Matching : 0.00
% 2.23/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------