TSTP Solution File: SET670^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET670^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 02:55:14 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 21 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 4 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 82 ( 9 ~; 5 |; 11 &; 51 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 34 ( 14 ^ 20 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_40,type,
is_rel_on: ( $i > $i > $o ) > ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_41,type,
restrict_rel_domain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(decl_57,type,
epred1_0: $i > $o ).
thf(decl_58,type,
epred2_0: $i > $i > $o ).
thf(decl_59,type,
epred3_0: $i > $o ).
thf(decl_60,type,
epred4_0: $i > $o ).
thf(decl_61,type,
esk1_0: $i ).
thf(decl_62,type,
esk2_0: $i ).
thf(is_rel_on,axiom,
( is_rel_on
= ( ^ [X28: $i > $i > $o,X29: $i > $o,X30: $i > $o] :
! [X1: $i,X3: $i] :
( ( X28 @ X1 @ X3 )
=> ( ( X29 @ X1 )
& ( X30 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',is_rel_on) ).
thf(restrict_rel_domain,axiom,
( restrict_rel_domain
= ( ^ [X28: $i > $i > $o,X25: $i > $o,X1: $i,X3: $i] :
( ( X25 @ X1 )
& ( X28 @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',restrict_rel_domain) ).
thf(thm,conjecture,
! [X36: $i > $o,X28: $i > $i > $o,X37: $i > $o,X38: $i > $o] :
( ( is_rel_on @ X28 @ X37 @ X38 )
=> ( is_rel_on @ ( restrict_rel_domain @ X28 @ X36 ) @ X36 @ X38 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_3,plain,
( is_rel_on
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i > $o] :
! [X1: $i,X3: $i] :
( ( Z0 @ X1 @ X3 )
=> ( ( Z1 @ X1 )
& ( Z2 @ X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[is_rel_on]) ).
thf(c_0_4,plain,
( restrict_rel_domain
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i,Z3: $i] :
( ( Z1 @ Z2 )
& ( Z0 @ Z2 @ Z3 ) ) ) ),
inference(fof_simplification,[status(thm)],[restrict_rel_domain]) ).
thf(c_0_5,negated_conjecture,
~ ! [X36: $i > $o,X28: $i > $i > $o,X37: $i > $o,X38: $i > $o] :
( ! [X51: $i,X52: $i] :
( ( X28 @ X51 @ X52 )
=> ( ( X37 @ X51 )
& ( X38 @ X52 ) ) )
=> ! [X53: $i,X54: $i] :
( ( ( X36 @ X53 )
& ( X28 @ X53 @ X54 ) )
=> ( ( X36 @ X53 )
& ( X38 @ X54 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_3]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X59: $i,X60: $i] :
( ( ( epred3_0 @ X59 )
| ~ ( epred2_0 @ X59 @ X60 ) )
& ( ( epred4_0 @ X60 )
| ~ ( epred2_0 @ X59 @ X60 ) )
& ( epred1_0 @ esk1_0 )
& ( epred2_0 @ esk1_0 @ esk2_0 )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred4_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_5])])])])])]) ).
thf(c_0_7,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred4_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X1: $i] :
( ( epred4_0 @ X1 )
| ~ ( epred2_0 @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
epred2_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
~ ( epred4_0 @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET670^3 : TPTP v8.2.0. Released v3.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 12:19:37 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/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.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # full_lambda_8 with pid 5429 completed with status 0
% 0.21/0.51 # Result found by full_lambda_8
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 5432 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 71
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 40
% 0.21/0.51 # Removed in clause preprocessing : 35
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 11
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 11
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 2
% 0.21/0.51 # ...of the previous two non-redundant : 1
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 2
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 1
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 6
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 2
% 0.21/0.52 # Current number of unprocessed clauses: 0
% 0.21/0.52 # ...number of literals in the above : 0
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 5
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 11
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2021
% 0.21/0.52 # Search garbage collected termcells : 265
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.003 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.006 s
% 0.21/0.52 # Maximum resident set size: 1912 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.010 s
% 0.21/0.52 # Maximum resident set size: 1808 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------