TSTP Solution File: SYO403^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO403^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 May 21 08:45:53 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 15 unt; 10 typ; 0 def)
% Number of atoms : 61 ( 11 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 106 ( 20 ~; 19 |; 3 &; 64 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 24 ^ 13 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_k: $i > $i > $o ).
thf(decl_54,type,
mbox_k: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
p: $i > $o ).
thf(decl_57,type,
q: $i > $o ).
thf(decl_58,type,
esk1_0: $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mbox_k,axiom,
( mbox_k
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_k @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^1.ax',mbox_k) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mor @ ( mbox_k @ p ) @ ( mbox_k @ q ) ) @ ( mbox_k @ ( mor @ p @ q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(c_0_6,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_10,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_11,plain,
( mbox_k
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_k @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_k]) ).
thf(c_0_12,negated_conjecture,
~ ! [X25: $i] :
( ~ ( ! [X22: $i] :
( ~ ( rel_k @ X25 @ X22 )
| ( p @ X22 ) )
| ! [X23: $i] :
( ~ ( rel_k @ X25 @ X23 )
| ( q @ X23 ) ) )
| ! [X24: $i] :
( ~ ( rel_k @ X25 @ X24 )
| ( p @ X24 )
| ( q @ X24 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_8]),c_0_9]),c_0_10]),c_0_11])]) ).
thf(c_0_13,negated_conjecture,
! [X27: $i,X28: $i] :
( ( ~ ( rel_k @ esk1_0 @ X27 )
| ( p @ X27 )
| ~ ( rel_k @ esk1_0 @ X28 )
| ( q @ X28 ) )
& ( rel_k @ esk1_0 @ esk2_0 )
& ~ ( p @ esk2_0 )
& ~ ( q @ esk2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X14: $i] :
( ( p @ X3 )
| ( q @ X14 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( rel_k @ esk1_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
rel_k @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
~ ( q @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_k @ esk1_0 @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
~ ( p @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO403^1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.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 : Mon May 20 08:43:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.48 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.48 # ehoh_best2_full_lfho with pid 22707 completed with status 0
% 0.20/0.48 # Result found by ehoh_best2_full_lfho
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.48 # new_ho_10 with pid 22711 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 71
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 41
% 0.20/0.48 # Removed in clause preprocessing : 37
% 0.20/0.48 # Initial clauses in saturation : 4
% 0.20/0.48 # Processed clauses : 9
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 9
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 2
% 0.20/0.48 # ...of the previous two non-redundant : 1
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 2
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 0
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 4
% 0.20/0.48 # Positive orientable unit clauses : 1
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 1
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 5
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 3
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 3
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 9
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2269
% 0.20/0.48 # Search garbage collected termcells : 423
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1908 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.007 s
% 0.20/0.48 # Total time : 0.011 s
% 0.20/0.48 # Maximum resident set size: 1800 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------