TSTP Solution File: SYO066^4.001 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO066^4.001 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:44:30 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 16 unt; 11 typ; 0 def)
% Number of atoms : 53 ( 11 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 4 ~; 5 |; 3 &; 51 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 36 ( 22 ^ 14 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
irel: $i > $i > $o ).
thf(decl_24,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_28,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_33,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_42,type,
o11: $i > $o ).
thf(decl_43,type,
o21: $i > $o ).
thf(decl_44,type,
esk1_0: $i ).
thf(decl_45,type,
esk2_0: $i ).
thf(decl_46,type,
esk3_0: $i ).
thf(ior,axiom,
( ior
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mor @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',ior) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mor) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mbox_s4) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',ivalid) ).
thf(con,conjecture,
ivalid @ ( ior @ ( iatom @ o11 ) @ ( iatom @ o21 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(axiom1,axiom,
ivalid @ ( iatom @ o11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1) ).
thf(c_0_7,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ior]) ).
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,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_10,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_11,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_13,negated_conjecture,
~ ! [X41: $i] :
( ! [X39: $i] :
( ( irel @ X41 @ X39 )
=> ( o11 @ X39 ) )
| ! [X40: $i] :
( ( irel @ X41 @ X40 )
=> ( o21 @ X40 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,plain,
! [X37: $i] : ( o11 @ X37 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom1,c_0_10]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
( ( irel @ esk1_0 @ esk2_0 )
& ~ ( o11 @ esk2_0 )
& ( irel @ esk1_0 @ esk3_0 )
& ~ ( o21 @ esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
thf(c_0_16,plain,
! [X46: $i] : ( o11 @ X46 ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
~ ( o11 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,plain,
! [X1: $i] : ( o11 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO066^4.001 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n004.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 09:38:38 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running higher-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0-ho
% 0.14/0.41 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho3 with 300s (1) cores
% 0.14/0.41 # Starting post_as_ho11 with 300s (1) cores
% 0.14/0.41 # Starting full_lambda_8 with 300s (1) cores
% 0.14/0.41 # post_as_ho3 with pid 16825 completed with status 0
% 0.14/0.41 # Result found by post_as_ho3
% 0.14/0.41 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho3 with 300s (1) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: HHUNS-FFSF00-SHSSMFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting new_ho_10 with 163s (1) cores
% 0.14/0.41 # new_ho_10 with pid 16828 completed with status 0
% 0.14/0.41 # Result found by new_ho_10
% 0.14/0.41 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.14/0.41 # Starting post_as_ho3 with 300s (1) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: HHUNS-FFSF00-SHSSMFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting new_ho_10 with 163s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 46
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 30
% 0.14/0.41 # Removed in clause preprocessing : 22
% 0.14/0.41 # Initial clauses in saturation : 8
% 0.14/0.41 # Processed clauses : 5
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 5
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 1
% 0.14/0.41 # Generated clauses : 0
% 0.14/0.41 # ...of the previous two non-redundant : 0
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 0
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 1
% 0.14/0.41 # ...of those cached : 0
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 4
% 0.14/0.41 # Positive orientable unit clauses : 3
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 3
% 0.14/0.41 # ...number of literals in the above : 5
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 1
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 0
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 1
% 0.14/0.41 # BW rewrite match successes : 1
% 0.14/0.41 # Condensation attempts : 5
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 1556
% 0.14/0.41 # Search garbage collected termcells : 432
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.002 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.004 s
% 0.14/0.41 # Maximum resident set size: 1888 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.007 s
% 0.14/0.41 # Maximum resident set size: 1756 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------