TSTP Solution File: MSC012+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.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 : n004.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 10:49:49 EDT 2023
% Result : Theorem 3.02s 1.79s
% Output : CNFRefutation 3.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 23 ~; 21 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 30 (; 28 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > p > #nlpp > goal > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(p,type,
p: $i > $o ).
tff(goal,type,
goal: $o ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(f_48,axiom,
! [A] :
? [B] : less(A,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).
tff(f_39,axiom,
! [A] :
( p(A)
| ? [B] :
( less(A,B)
& p(B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).
tff(f_45,axiom,
! [A,B,C] :
( ( less(A,B)
& less(B,C) )
=> less(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_less) ).
tff(f_50,negated_conjecture,
~ goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
tff(f_32,axiom,
! [A,B] :
( ( p(A)
& less(A,B)
& p(B) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).
tff(c_10,plain,
! [A_8] : less(A_8,'#skF_2'(A_8)),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_4,plain,
! [A_3] :
( p('#skF_1'(A_3))
| p(A_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_6,plain,
! [A_3] :
( less(A_3,'#skF_1'(A_3))
| p(A_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_26,plain,
! [A_15,C_16,B_17] :
( less(A_15,C_16)
| ~ less(B_17,C_16)
| ~ less(A_15,B_17) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_43,plain,
! [A_23,A_24] :
( less(A_23,'#skF_1'(A_24))
| ~ less(A_23,A_24)
| p(A_24) ),
inference(resolution,[status(thm)],[c_6,c_26]) ).
tff(c_12,plain,
~ goal,
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_2,plain,
! [B_2,A_1] :
( goal
| ~ p(B_2)
| ~ less(A_1,B_2)
| ~ p(A_1) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_13,plain,
! [B_2,A_1] :
( ~ p(B_2)
| ~ less(A_1,B_2)
| ~ p(A_1) ),
inference(negUnitSimplification,[status(thm)],[c_12,c_2]) ).
tff(c_118,plain,
! [A_33,A_34] :
( ~ p('#skF_1'(A_33))
| ~ p(A_34)
| ~ less(A_34,A_33)
| p(A_33) ),
inference(resolution,[status(thm)],[c_43,c_13]) ).
tff(c_122,plain,
! [A_35,A_36] :
( ~ p(A_35)
| ~ less(A_35,A_36)
| p(A_36) ),
inference(resolution,[status(thm)],[c_4,c_118]) ).
tff(c_147,plain,
! [A_37] :
( ~ p(A_37)
| p('#skF_2'(A_37)) ),
inference(resolution,[status(thm)],[c_10,c_122]) ).
tff(c_17,plain,
! [B_13,A_14] :
( ~ p(B_13)
| ~ less(A_14,B_13)
| ~ p(A_14) ),
inference(negUnitSimplification,[status(thm)],[c_12,c_2]) ).
tff(c_25,plain,
! [A_8] :
( ~ p('#skF_2'(A_8))
| ~ p(A_8) ),
inference(resolution,[status(thm)],[c_10,c_17]) ).
tff(c_158,plain,
! [A_37] : ~ p(A_37),
inference(resolution,[status(thm)],[c_147,c_25]) ).
tff(c_164,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_158,c_158,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/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 : n004.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 13:05:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.02/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.02/1.79
% 3.02/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.08/1.82
% 3.08/1.82 Inference rules
% 3.08/1.82 ----------------------
% 3.08/1.82 #Ref : 0
% 3.08/1.82 #Sup : 34
% 3.08/1.82 #Fact : 0
% 3.08/1.82 #Define : 0
% 3.08/1.82 #Split : 0
% 3.08/1.82 #Chain : 0
% 3.08/1.82 #Close : 0
% 3.08/1.82
% 3.08/1.82 Ordering : KBO
% 3.08/1.82
% 3.08/1.82 Simplification rules
% 3.08/1.82 ----------------------
% 3.08/1.82 #Subsume : 9
% 3.08/1.82 #Demod : 0
% 3.08/1.82 #Tautology : 1
% 3.08/1.82 #SimpNegUnit : 6
% 3.08/1.82 #BackRed : 3
% 3.08/1.82
% 3.08/1.82 #Partial instantiations: 0
% 3.08/1.82 #Strategies tried : 1
% 3.08/1.82
% 3.08/1.82 Timing (in seconds)
% 3.08/1.82 ----------------------
% 3.08/1.82 Preprocessing : 0.41
% 3.08/1.82 Parsing : 0.23
% 3.08/1.82 CNF conversion : 0.02
% 3.08/1.82 Main loop : 0.27
% 3.08/1.82 Inferencing : 0.13
% 3.08/1.82 Reduction : 0.05
% 3.08/1.82 Demodulation : 0.04
% 3.08/1.82 BG Simplification : 0.02
% 3.08/1.82 Subsumption : 0.06
% 3.08/1.83 Abstraction : 0.01
% 3.08/1.83 MUC search : 0.00
% 3.08/1.83 Cooper : 0.00
% 3.08/1.83 Total : 0.72
% 3.08/1.83 Index Insertion : 0.00
% 3.08/1.83 Index Deletion : 0.00
% 3.08/1.83 Index Matching : 0.00
% 3.12/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------