TSTP Solution File: SYN053+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN053+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 : 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:09:09 EDT 2023
% Result : Theorem 2.55s 1.64s
% Output : CNFRefutation 2.69s
% 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 ~; 6 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 :
%------------------------------------------------------------------------------
%$ 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_35,negated_conjecture,
~ ( ! [X] :
( p
| big_f(X) )
<=> ( p
| ! [X1] : big_f(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel23) ).
tff(c_10,plain,
~ p,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_18,plain,
! [X_1,X1_2] :
( big_f(X_1)
| big_f(X1_2)
| p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_19,plain,
! [X_1,X1_2] :
( big_f(X_1)
| big_f(X1_2) ),
inference(negUnitSimplification,[status(thm)],[c_10,c_18]) ).
tff(c_33,plain,
! [X1_2] : big_f(X1_2),
inference(splitLeft,[status(thm)],[c_19]) ).
tff(c_23,plain,
! [X1_2] : big_f(X1_2),
inference(splitLeft,[status(thm)],[c_19]) ).
tff(c_2,plain,
( ~ big_f('#skF_1')
| ~ big_f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_22,plain,
~ big_f('#skF_2'),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_26,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_22]) ).
tff(c_27,plain,
! [X_1] : big_f(X_1),
inference(splitRight,[status(thm)],[c_19]) ).
tff(c_30,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_27,c_22]) ).
tff(c_31,plain,
~ big_f('#skF_1'),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_33,c_31]) ).
tff(c_38,plain,
! [X_1] : big_f(X_1),
inference(splitRight,[status(thm)],[c_19]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_38,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN053+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.14 % 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.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 16:57:28 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.55/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/1.65
% 2.55/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.69/1.68
% 2.69/1.68 Inference rules
% 2.69/1.68 ----------------------
% 2.69/1.68 #Ref : 0
% 2.69/1.68 #Sup : 0
% 2.69/1.68 #Fact : 0
% 2.69/1.68 #Define : 0
% 2.69/1.68 #Split : 3
% 2.69/1.68 #Chain : 0
% 2.69/1.68 #Close : 0
% 2.69/1.68
% 2.69/1.68 Ordering : KBO
% 2.69/1.68
% 2.69/1.68 Simplification rules
% 2.69/1.68 ----------------------
% 2.69/1.68 #Subsume : 3
% 2.69/1.68 #Demod : 6
% 2.69/1.68 #Tautology : 4
% 2.69/1.68 #SimpNegUnit : 3
% 2.69/1.68 #BackRed : 4
% 2.69/1.68
% 2.69/1.68 #Partial instantiations: 0
% 2.69/1.68 #Strategies tried : 1
% 2.69/1.68
% 2.69/1.68 Timing (in seconds)
% 2.69/1.68 ----------------------
% 2.69/1.68 Preprocessing : 0.39
% 2.69/1.68 Parsing : 0.22
% 2.69/1.68 CNF conversion : 0.02
% 2.69/1.68 Main loop : 0.13
% 2.69/1.69 Inferencing : 0.03
% 2.69/1.69 Reduction : 0.03
% 2.69/1.69 Demodulation : 0.02
% 2.69/1.69 BG Simplification : 0.01
% 2.69/1.69 Subsumption : 0.04
% 2.69/1.69 Abstraction : 0.01
% 2.69/1.69 MUC search : 0.00
% 2.69/1.69 Cooper : 0.00
% 2.69/1.69 Total : 0.57
% 2.69/1.69 Index Insertion : 0.00
% 2.69/1.69 Index Deletion : 0.00
% 2.69/1.69 Index Matching : 0.00
% 2.69/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------