TSTP Solution File: LCL709^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL709^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Mon May 20 23:53:12 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 19 unt; 10 typ; 0 def)
% Number of atoms : 43 ( 15 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 95 ( 13 ~; 12 |; 2 &; 66 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 75 ( 75 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 54 ( 33 ^ 21 !; 0 ?; 54 :)
% 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_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
epred1_0: $i > $i > $o ).
thf(decl_54,type,
esk1_2: $i > ( $i > $o ) > $i ).
thf(decl_55,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(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(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ X18 ) @ X18 ) ) )
=> ( mreflexive @ X13 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_8,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_9,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_12,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_13,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_8,c_0_9]),c_0_10]) ).
thf(c_0_14,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_15,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_16,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X24: $i,X23: $i > $o] :
( ~ ! [X22: $i] :
( ~ ( X13 @ X24 @ X22 )
| ( X23 @ X22 ) )
| ( X23 @ X24 ) )
=> ! [X25: $i] : ( X13 @ X25 @ X25 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X27: $i,X28: $i > $o] :
( ( ( epred1_0 @ X27 @ ( esk1_2 @ X27 @ X28 ) )
| ( X28 @ X27 ) )
& ( ~ ( X28 @ ( esk1_2 @ X27 @ X28 ) )
| ( X28 @ X27 ) )
& ~ ( epred1_0 @ esk2_0 @ esk2_0 ) ),
inference(distribute,[status(thm)],[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_16])])])])])]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X4: $i > $o] :
( ( X4 @ X3 )
| ~ ( X4 @ ( esk1_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X4: $i > $o,X3: $i] :
( ( epred1_0 @ X3 @ ( esk1_2 @ X3 @ X4 ) )
| ( X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
~ ( epred1_0 @ esk2_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i] : ( epred1_0 @ X3 @ X3 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL709^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.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 : 300
% 0.13/0.35 % DateTime : Mon May 20 00:53:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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.22/0.52 # Version: 3.1.0-ho
% 0.22/0.52 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.22/0.52 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.52 # lpo9_lambda_fix with pid 3529 completed with status 0
% 0.22/0.52 # Result found by lpo9_lambda_fix
% 0.22/0.52 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.22/0.52 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: HGUNF-FFSF22-SHHSMMBN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.52 # new_ho_10 with pid 3532 completed with status 0
% 0.22/0.52 # Result found by new_ho_10
% 0.22/0.52 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.22/0.52 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: HGUNF-FFSF22-SHHSMMBN
% 0.22/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 64
% 0.22/0.52 # Removed by relevancy pruning/SinE : 50
% 0.22/0.52 # Initial clauses : 3
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 3
% 0.22/0.52 # Processed clauses : 7
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 7
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 1
% 0.22/0.52 # Generated clauses : 1
% 0.22/0.52 # ...of the previous two non-redundant : 1
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 1
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 1
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 3
% 0.22/0.52 # Positive orientable unit clauses : 1
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 2
% 0.22/0.52 # Current number of unprocessed clauses: 0
% 0.22/0.52 # ...number of literals in the above : 0
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 4
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 2
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 2
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 1
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 2
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 7
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1277
% 0.22/0.52 # Search garbage collected termcells : 501
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.001 s
% 0.22/0.52 # System time : 0.004 s
% 0.22/0.52 # Total time : 0.005 s
% 0.22/0.52 # Maximum resident set size: 1928 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.004 s
% 0.22/0.52 # System time : 0.005 s
% 0.22/0.52 # Total time : 0.009 s
% 0.22/0.52 # Maximum resident set size: 1796 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------