TSTP Solution File: SYN924+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN924+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 : n003.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:16:52 EDT 2023
% Result : Theorem 2.08s 1.55s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 8 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 (; 12 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%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_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_36,negated_conjecture,
~ ( ? [X] :
( p(X)
| q(X) )
<=> ( ? [X] : p(X)
| ? [X] : q(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_4,plain,
! [X_1,X_3] :
( ~ p(X_1)
| ~ p(X_3) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_21,plain,
! [X_3] : ~ p(X_3),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_10,plain,
! [X_1,X_3] :
( ~ p(X_1)
| ~ q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_19,plain,
! [X_3] : ~ q(X_3),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_18,plain,
( p('#skF_2')
| q('#skF_1')
| q('#skF_4')
| p('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_27,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_21,c_19,c_19,c_21,c_18]) ).
tff(c_28,plain,
! [X_1] : ~ p(X_1),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_34,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_19,c_19,c_28,c_18]) ).
tff(c_35,plain,
! [X_1] : ~ p(X_1),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_8,plain,
! [X_2,X_3] :
( ~ q(X_2)
| ~ q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_37,plain,
! [X_3] : ~ q(X_3),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_43,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_35,c_37,c_37,c_35,c_18]) ).
tff(c_44,plain,
! [X_2] : ~ q(X_2),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_50,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_35,c_44,c_44,c_35,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN924+1 : TPTP v8.1.2. Released v3.1.0.
% 0.15/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 : n003.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:12:38 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.08/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.08/1.55
% 2.08/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.08/1.59
% 2.08/1.59 Inference rules
% 2.08/1.59 ----------------------
% 2.08/1.59 #Ref : 0
% 2.08/1.59 #Sup : 0
% 2.08/1.59 #Fact : 0
% 2.08/1.59 #Define : 0
% 2.08/1.59 #Split : 3
% 2.08/1.59 #Chain : 0
% 2.08/1.59 #Close : 0
% 2.08/1.59
% 2.08/1.59 Ordering : KBO
% 2.08/1.59
% 2.08/1.59 Simplification rules
% 2.08/1.59 ----------------------
% 2.08/1.59 #Subsume : 20
% 2.08/1.59 #Demod : 0
% 2.08/1.59 #Tautology : 0
% 2.08/1.59 #SimpNegUnit : 20
% 2.08/1.59 #BackRed : 0
% 2.08/1.59
% 2.08/1.59 #Partial instantiations: 0
% 2.08/1.59 #Strategies tried : 1
% 2.08/1.59
% 2.08/1.59 Timing (in seconds)
% 2.08/1.59 ----------------------
% 2.08/1.59 Preprocessing : 0.39
% 2.08/1.59 Parsing : 0.21
% 2.08/1.59 CNF conversion : 0.03
% 2.08/1.59 Main loop : 0.11
% 2.08/1.60 Inferencing : 0.02
% 2.08/1.60 Reduction : 0.02
% 2.08/1.60 Demodulation : 0.01
% 2.08/1.60 BG Simplification : 0.01
% 2.08/1.60 Subsumption : 0.04
% 2.08/1.60 Abstraction : 0.01
% 2.08/1.60 MUC search : 0.00
% 2.08/1.60 Cooper : 0.00
% 2.08/1.60 Total : 0.56
% 2.08/1.60 Index Insertion : 0.00
% 2.08/1.60 Index Deletion : 0.00
% 2.08/1.60 Index Matching : 0.00
% 2.08/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------