TSTP Solution File: SYN936+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN936+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 : n019.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:54 EDT 2023
% Result : Theorem 2.16s 1.57s
% Output : CNFRefutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > c > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c,type,
c: $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_35,negated_conjecture,
~ ( ! [X] :
( c
=> p(X) )
<=> ( c
=> ! [X] : p(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_10,plain,
c,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_18,plain,
! [X_1,X_2] :
( p(X_1)
| p(X_2)
| ~ c ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_20,plain,
! [X_1,X_2] :
( p(X_1)
| p(X_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_18]) ).
tff(c_38,plain,
! [X_2] : p(X_2),
inference(splitLeft,[status(thm)],[c_20]) ).
tff(c_28,plain,
! [X_2] : p(X_2),
inference(splitLeft,[status(thm)],[c_20]) ).
tff(c_2,plain,
( ~ p('#skF_1')
| ~ p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_27,plain,
~ p('#skF_2'),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_31,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_27]) ).
tff(c_32,plain,
! [X_1] : p(X_1),
inference(splitRight,[status(thm)],[c_20]) ).
tff(c_35,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_27]) ).
tff(c_36,plain,
~ p('#skF_1'),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_36]) ).
tff(c_43,plain,
! [X_1] : p(X_1),
inference(splitRight,[status(thm)],[c_20]) ).
tff(c_47,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_43,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN936+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:23:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.16/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.16/1.57
% 2.16/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.16/1.60
% 2.16/1.60 Inference rules
% 2.16/1.60 ----------------------
% 2.16/1.60 #Ref : 0
% 2.16/1.60 #Sup : 0
% 2.16/1.60 #Fact : 0
% 2.16/1.60 #Define : 0
% 2.16/1.60 #Split : 3
% 2.16/1.60 #Chain : 0
% 2.16/1.60 #Close : 0
% 2.16/1.60
% 2.16/1.60 Ordering : KBO
% 2.16/1.60
% 2.16/1.60 Simplification rules
% 2.16/1.60 ----------------------
% 2.16/1.60 #Subsume : 1
% 2.16/1.60 #Demod : 11
% 2.16/1.60 #Tautology : 6
% 2.16/1.60 #SimpNegUnit : 0
% 2.16/1.60 #BackRed : 4
% 2.16/1.60
% 2.16/1.60 #Partial instantiations: 0
% 2.16/1.60 #Strategies tried : 1
% 2.16/1.60
% 2.16/1.60 Timing (in seconds)
% 2.16/1.60 ----------------------
% 2.16/1.61 Preprocessing : 0.40
% 2.16/1.61 Parsing : 0.22
% 2.16/1.61 CNF conversion : 0.02
% 2.16/1.61 Main loop : 0.13
% 2.16/1.61 Inferencing : 0.03
% 2.16/1.61 Reduction : 0.03
% 2.16/1.61 Demodulation : 0.02
% 2.16/1.61 BG Simplification : 0.01
% 2.16/1.61 Subsumption : 0.04
% 2.16/1.61 Abstraction : 0.01
% 2.16/1.61 MUC search : 0.00
% 2.16/1.61 Cooper : 0.00
% 2.16/1.61 Total : 0.58
% 2.16/1.61 Index Insertion : 0.00
% 2.16/1.61 Index Deletion : 0.00
% 2.16/1.61 Index Matching : 0.00
% 2.16/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------