TSTP Solution File: LCL538+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:40 EDT 2022
% Result : Theorem 6.65s 2.26s
% Output : CNFRefutation 6.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 76 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 67 ( 25 ~; 27 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X1] : is_a_theorem(implies(necessarily(X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(km4b_axiom_M,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_M) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(s1_0_modus_ponens_strict_implies,conjecture,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(modus_ponens_strict_implies,axiom,
( modus_ponens_strict_implies
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).
fof(c_0_8,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_9,plain,
! [X145] :
( ( ~ axiom_M
| is_a_theorem(implies(necessarily(X145),X145)) )
& ( ~ is_a_theorem(implies(necessarily(esk65_0),esk65_0))
| axiom_M ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_M])])])]) ).
cnf(c_0_10,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(necessarily(X1),X1))
| ~ axiom_M ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
axiom_M,
inference(split_conjunct,[status(thm)],[km4b_axiom_M]) ).
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,negated_conjecture,
~ modus_ponens_strict_implies,
inference(assume_negation,[status(cth)],[s1_0_modus_ponens_strict_implies]) ).
cnf(c_0_16,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_10,c_0_11])]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(necessarily(X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
( strict_implies(X1,X2) = necessarily(implies(X1,X2))
| ~ op_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_20,plain,
! [X129,X130] :
( ( ~ modus_ponens_strict_implies
| ~ is_a_theorem(X129)
| ~ is_a_theorem(strict_implies(X129,X130))
| is_a_theorem(X130) )
& ( is_a_theorem(esk57_0)
| modus_ponens_strict_implies )
& ( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies )
& ( ~ is_a_theorem(esk58_0)
| modus_ponens_strict_implies ) ),
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_strict_implies])])])])]) ).
fof(c_0_21,negated_conjecture,
~ modus_ponens_strict_implies,
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(necessarily(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,plain,
( is_a_theorem(strict_implies(esk57_0,esk58_0))
| modus_ponens_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ modus_ponens_strict_implies,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
is_a_theorem(strict_implies(esk57_0,esk58_0)),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( is_a_theorem(esk57_0)
| modus_ponens_strict_implies ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( modus_ponens_strict_implies
| ~ is_a_theorem(esk58_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(esk57_0,esk58_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
is_a_theorem(esk57_0),
inference(sr,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_32,plain,
~ is_a_theorem(esk58_0),
inference(sr,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 21:08:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.65/2.26 # ENIGMATIC: Solved by autoschedule:
% 6.65/2.26 # No SInE strategy applied
% 6.65/2.26 # Trying AutoSched0 for 150 seconds
% 6.65/2.26 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 6.65/2.26 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.65/2.26 #
% 6.65/2.26 # Preprocessing time : 0.030 s
% 6.65/2.26 # Presaturation interreduction done
% 6.65/2.26
% 6.65/2.26 # Proof found!
% 6.65/2.26 # SZS status Theorem
% 6.65/2.26 # SZS output start CNFRefutation
% See solution above
% 6.65/2.26 # Training examples: 0 positive, 0 negative
% 6.65/2.26
% 6.65/2.26 # -------------------------------------------------
% 6.65/2.26 # User time : 0.039 s
% 6.65/2.26 # System time : 0.008 s
% 6.65/2.26 # Total time : 0.047 s
% 6.65/2.26 # Maximum resident set size: 7124 pages
% 6.65/2.26
%------------------------------------------------------------------------------