TSTP Solution File: MSC012+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:37:34 EDT 2023
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 19 ~; 20 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 31 ( 2 sgn; 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_to_right,axiom,
! [X1,X2] :
( ( p(X1)
& less(X1,X2)
& p(X2) )
=> goal ),
file('/export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p',left_to_right) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p',goal_to_be_proved) ).
fof(transitive_less,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p',transitive_less) ).
fof(right_to_left,axiom,
! [X1] :
( p(X1)
| ? [X2] :
( less(X1,X2)
& p(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p',right_to_left) ).
fof(serial_less,axiom,
! [X1] :
? [X2] : less(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p',serial_less) ).
fof(c_0_5,plain,
! [X4,X5] :
( ~ p(X4)
| ~ less(X4,X5)
| ~ p(X5)
| goal ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[left_to_right])]) ).
fof(c_0_6,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
fof(c_0_7,plain,
! [X8,X9,X10] :
( ~ less(X8,X9)
| ~ less(X9,X10)
| less(X8,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive_less])]) ).
fof(c_0_8,plain,
! [X6] :
( ( less(X6,esk1_1(X6))
| p(X6) )
& ( p(esk1_1(X6))
| p(X6) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[right_to_left])])]) ).
cnf(c_0_9,plain,
( goal
| ~ p(X1)
| ~ less(X1,X2)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( less(X1,esk1_1(X1))
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| ~ p(X2)
| ~ p(X1) ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( less(X1,esk1_1(X2))
| p(X2)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( p(esk1_1(X1))
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X11] : less(X11,esk2_1(X11)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[serial_less])]) ).
cnf(c_0_17,plain,
( ~ less(X1,X2)
| ~ p(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_13]) ).
cnf(c_0_18,plain,
less(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
~ p(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_19]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : MSC012+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n014.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 11:15:50 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.LuWV7QZXmp/E---3.1_30700.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # sh5l with pid 30781 completed with status 0
% 0.22/0.54 # Result found by sh5l
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.22/0.54 # SAT001_CO_MinMin_p005000_rr with pid 30782 completed with status 0
% 0.22/0.54 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 5
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 6
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 6
% 0.22/0.54 # Processed clauses : 20
% 0.22/0.54 # ...of these trivial : 0
% 0.22/0.54 # ...subsumed : 0
% 0.22/0.54 # ...remaining for further processing : 20
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 4
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 22
% 0.22/0.54 # ...of the previous two non-redundant : 18
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 2
% 0.22/0.54 # Paramodulations : 20
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Total rewrite steps : 0
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 8
% 0.22/0.54 # Positive orientable unit clauses : 1
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 2
% 0.22/0.54 # Non-unit-clauses : 5
% 0.22/0.54 # Current number of unprocessed clauses: 10
% 0.22/0.54 # ...number of literals in the above : 27
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 12
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 30
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 18
% 0.22/0.54 # Non-unit clause-clause subsumptions : 4
% 0.22/0.54 # Unit Clause-clause subsumption calls : 2
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 0
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 20
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 589
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.005 s
% 0.22/0.54 # System time : 0.000 s
% 0.22/0.54 # Total time : 0.005 s
% 0.22/0.54 # Maximum resident set size: 1752 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.007 s
% 0.22/0.54 # System time : 0.001 s
% 0.22/0.54 # Total time : 0.007 s
% 0.22/0.54 # Maximum resident set size: 1672 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------