TSTP Solution File: SYN922+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN922+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/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 : n025.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.49s 1.59s
% Output : CNFRefutation 2.63s
% 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 : 14 ( 5 ~; 6 |; 2 &)
% ( 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 (; 15 !; 0 ?; 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/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_12,plain,
! [X_1,X_3] :
( q(X_1)
| q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_22,plain,
! [X_3] : q(X_3),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_18,plain,
! [X_1,X_2] :
( q(X_1)
| p(X_2) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_19,plain,
! [X_2] : p(X_2),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_2,plain,
( ~ q('#skF_2')
| ~ p('#skF_1')
| ~ p('#skF_4')
| ~ q('#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_33,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_19,c_19,c_22,c_2]) ).
tff(c_34,plain,
! [X_1] : q(X_1),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_45,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_19,c_19,c_34,c_2]) ).
tff(c_46,plain,
! [X_1] : q(X_1),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_16,plain,
! [X_1,X_2] :
( p(X_1)
| p(X_2) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_48,plain,
! [X_2] : p(X_2),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_60,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_46,c_48,c_48,c_46,c_2]) ).
tff(c_61,plain,
! [X_1] : p(X_1),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_73,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_46,c_61,c_61,c_46,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN922+1 : TPTP v8.1.2. Released v3.1.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.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:37:04 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.49/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.49/1.60
% 2.49/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.63/1.63
% 2.63/1.63 Inference rules
% 2.63/1.63 ----------------------
% 2.63/1.63 #Ref : 0
% 2.63/1.63 #Sup : 0
% 2.63/1.63 #Fact : 0
% 2.63/1.63 #Define : 0
% 2.63/1.63 #Split : 3
% 2.63/1.63 #Chain : 0
% 2.63/1.63 #Close : 0
% 2.63/1.63
% 2.63/1.63 Ordering : KBO
% 2.63/1.63
% 2.63/1.63 Simplification rules
% 2.63/1.63 ----------------------
% 2.63/1.63 #Subsume : 1
% 2.63/1.63 #Demod : 70
% 2.63/1.63 #Tautology : 19
% 2.63/1.63 #SimpNegUnit : 0
% 2.63/1.63 #BackRed : 0
% 2.63/1.63
% 2.63/1.63 #Partial instantiations: 0
% 2.63/1.63 #Strategies tried : 1
% 2.63/1.63
% 2.63/1.63 Timing (in seconds)
% 2.63/1.63 ----------------------
% 2.63/1.64 Preprocessing : 0.40
% 2.63/1.64 Parsing : 0.22
% 2.63/1.64 CNF conversion : 0.03
% 2.63/1.64 Main loop : 0.14
% 2.63/1.64 Inferencing : 0.03
% 2.71/1.64 Reduction : 0.03
% 2.71/1.64 Demodulation : 0.03
% 2.71/1.64 BG Simplification : 0.01
% 2.71/1.64 Subsumption : 0.04
% 2.71/1.64 Abstraction : 0.01
% 2.71/1.64 MUC search : 0.00
% 2.71/1.64 Cooper : 0.00
% 2.71/1.64 Total : 0.59
% 2.71/1.64 Index Insertion : 0.00
% 2.71/1.64 Index Deletion : 0.00
% 2.71/1.64 Index Matching : 0.00
% 2.71/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------