TSTP Solution File: SYN051+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN051+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 : n012.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:09:08 EDT 2023
% Result : Theorem 2.28s 1.61s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 7 (; 4 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > p > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_40,negated_conjecture,
~ ? [X] :
( p
<=> big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21) ).
tff(f_31,axiom,
? [X] :
( p
=> big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21_1) ).
tff(f_35,axiom,
? [X] :
( big_f(X)
=> p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21_2) ).
tff(c_12,plain,
! [X_1] :
( p
| big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_13,plain,
p,
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_6,plain,
! [X_1] :
( ~ big_f(X_1)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_15,plain,
! [X_1] : ~ big_f(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_6]) ).
tff(c_2,plain,
( big_f('#skF_1')
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_19,plain,
big_f('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_2]) ).
tff(c_20,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_19]) ).
tff(c_22,plain,
~ p,
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_21,plain,
! [X_1] : big_f(X_1),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_4,plain,
( p
| ~ big_f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_25,plain,
p,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_4]) ).
tff(c_26,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN051+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 : n012.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:21:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.28/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.58/1.61
% 2.58/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.61/1.65
% 2.61/1.65 Inference rules
% 2.61/1.65 ----------------------
% 2.61/1.65 #Ref : 0
% 2.61/1.65 #Sup : 0
% 2.61/1.65 #Fact : 0
% 2.61/1.65 #Define : 0
% 2.61/1.65 #Split : 1
% 2.61/1.65 #Chain : 0
% 2.61/1.65 #Close : 0
% 2.61/1.65
% 2.61/1.65 Ordering : KBO
% 2.61/1.65
% 2.61/1.65 Simplification rules
% 2.61/1.65 ----------------------
% 2.61/1.65 #Subsume : 1
% 2.61/1.65 #Demod : 4
% 2.61/1.65 #Tautology : 2
% 2.61/1.65 #SimpNegUnit : 2
% 2.61/1.65 #BackRed : 0
% 2.61/1.65
% 2.61/1.65 #Partial instantiations: 0
% 2.61/1.65 #Strategies tried : 1
% 2.61/1.65
% 2.61/1.65 Timing (in seconds)
% 2.61/1.65 ----------------------
% 2.61/1.65 Preprocessing : 0.40
% 2.61/1.65 Parsing : 0.22
% 2.61/1.65 CNF conversion : 0.02
% 2.61/1.65 Main loop : 0.11
% 2.61/1.65 Inferencing : 0.03
% 2.61/1.65 Reduction : 0.02
% 2.61/1.65 Demodulation : 0.01
% 2.61/1.65 BG Simplification : 0.01
% 2.61/1.65 Subsumption : 0.03
% 2.61/1.65 Abstraction : 0.00
% 2.61/1.65 MUC search : 0.00
% 2.61/1.65 Cooper : 0.00
% 2.61/1.65 Total : 0.57
% 2.61/1.65 Index Insertion : 0.00
% 2.61/1.66 Index Deletion : 0.00
% 2.61/1.66 Index Matching : 0.00
% 2.61/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------