TSTP Solution File: LCL544+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL544+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : 600s
% DateTime : Sun Jul 17 09:26:42 EDT 2022
% Result : Theorem 7.89s 2.46s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 21 unt; 0 def)
% Number of atoms : 91 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 81 ( 33 ~; 31 |; 9 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_axiom_m4,conjecture,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',necessitation) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_m4) ).
fof(km4b_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+3.ax',km4b_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(c_0_12,negated_conjecture,
~ axiom_m4,
inference(assume_negation,[status(cth)],[s1_0_axiom_m4]) ).
fof(c_0_13,plain,
! [X127] :
( ( ~ necessitation
| ~ is_a_theorem(X127)
| is_a_theorem(necessarily(X127)) )
& ( is_a_theorem(esk56_0)
| necessitation )
& ( ~ is_a_theorem(necessarily(esk56_0))
| necessitation ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessitation])])])])]) ).
fof(c_0_14,plain,
! [X207,X208] :
( ~ op_strict_implies
| strict_implies(X207,X208) = necessarily(implies(X207,X208)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])]) ).
fof(c_0_15,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_16,plain,
! [X23,X24] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])]) ).
fof(c_0_17,plain,
! [X183] :
( ( ~ axiom_m4
| is_a_theorem(strict_implies(X183,and(X183,X183))) )
& ( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])]) ).
fof(c_0_18,negated_conjecture,
~ axiom_m4,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( is_a_theorem(necessarily(X1))
| ~ necessitation
| ~ is_a_theorem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km4b_necessitation]) ).
cnf(c_0_21,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_23,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_27,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])]) ).
cnf(c_0_28,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
~ axiom_m4,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( is_a_theorem(necessarily(X1))
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_31,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_32,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_36,plain,
~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( is_a_theorem(strict_implies(X1,X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_40,plain,
~ is_a_theorem(implies(esk84_0,and(esk84_0,esk84_0))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL544+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 19:20:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.89/2.46 # ENIGMATIC: Solved by autoschedule:
% 7.89/2.46 # No SInE strategy applied
% 7.89/2.46 # Trying AutoSched0 for 150 seconds
% 7.89/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 7.89/2.46 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.89/2.46 #
% 7.89/2.46 # Preprocessing time : 0.029 s
% 7.89/2.46 # Presaturation interreduction done
% 7.89/2.46
% 7.89/2.46 # Proof found!
% 7.89/2.46 # SZS status Theorem
% 7.89/2.46 # SZS output start CNFRefutation
% See solution above
% 7.89/2.46 # Training examples: 0 positive, 0 negative
% 7.89/2.46
% 7.89/2.46 # -------------------------------------------------
% 7.89/2.46 # User time : 0.040 s
% 7.89/2.46 # System time : 0.009 s
% 7.89/2.46 # Total time : 0.050 s
% 7.89/2.46 # Maximum resident set size: 7120 pages
% 7.89/2.46
%------------------------------------------------------------------------------