TSTP Solution File: SET624^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET624^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:00 EDT 2024
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 116 ( 4 equ; 0 cnn)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 247 ( 29 ~; 74 |; 16 &; 126 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 30 ( 10 ^ 15 !; 5 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_27,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_36,type,
epred1_0: $i > $o ).
thf(decl_37,type,
epred2_0: $i > $o ).
thf(decl_38,type,
epred3_0: $i > $o ).
thf(decl_39,type,
esk1_0: $i ).
thf(decl_40,type,
esk2_0: $i ).
thf(decl_41,type,
esk3_0: $i ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',union) ).
thf(meets,axiom,
( meets
= ( ^ [X18: $i > $o,X19: $i > $o] :
? [X4: $i] :
( ( X18 @ X4 )
& ( X19 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',meets) ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( meets @ X22 @ ( union @ X23 @ X24 ) )
<=> ( ( meets @ X22 @ X23 )
| ( meets @ X22 @ X24 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_3,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_4,plain,
( meets
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
? [X4: $i] :
( ( Z0 @ X4 )
& ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[meets]) ).
thf(c_0_5,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ? [X28: $i] :
( ( X22 @ X28 )
& ( ( X23 @ X28 )
| ( X24 @ X28 ) ) )
<=> ( ? [X29: $i] :
( ( X22 @ X29 )
& ( X23 @ X29 ) )
| ? [X30: $i] :
( ( X22 @ X30 )
& ( X24 @ X30 ) ) ) ),
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,
! [X34: $i,X35: $i,X36: $i] :
( ( ~ ( epred1_0 @ X35 )
| ~ ( epred2_0 @ X35 )
| ~ ( epred2_0 @ X34 )
| ~ ( epred1_0 @ X34 ) )
& ( ~ ( epred1_0 @ X36 )
| ~ ( epred3_0 @ X36 )
| ~ ( epred2_0 @ X34 )
| ~ ( epred1_0 @ X34 ) )
& ( ~ ( epred1_0 @ X35 )
| ~ ( epred2_0 @ X35 )
| ~ ( epred3_0 @ X34 )
| ~ ( epred1_0 @ X34 ) )
& ( ~ ( epred1_0 @ X36 )
| ~ ( epred3_0 @ X36 )
| ~ ( epred3_0 @ X34 )
| ~ ( epred1_0 @ X34 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_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,
! [X1: $i,X3: $i] :
( ~ ( epred1_0 @ X1 )
| ~ ( epred2_0 @ X1 )
| ~ ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( epred1_0 @ X1 )
| ~ ( epred3_0 @ X1 )
| ~ ( epred3_0 @ X3 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ~ ( epred1_0 @ X1 )
| ~ ( epred2_0 @ X1 ) ),
inference(condense,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ~ ( epred1_0 @ X1 )
| ~ ( epred3_0 @ X1 ) ),
inference(condense,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_19,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_16]) ).
thf(c_0_20,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_21,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_22,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_14]) ).
thf(c_0_24,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_21]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_23])]) ).
thf(c_0_26,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_24]),c_0_23])]) ).
thf(c_0_27,negated_conjecture,
epred1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_25]),c_0_23])]) ).
thf(c_0_28,negated_conjecture,
epred3_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26]),c_0_27])]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET624^3 : TPTP v8.2.0. Released v3.6.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 11:58:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running higher-order theorem proving
% 0.17/0.43 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.17/0.44 # Version: 3.1.0-ho
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # Starting sh1l with 300s (1) cores
% 0.17/0.44 # Starting post_as_ho10 with 300s (1) cores
% 0.17/0.44 # post_as_ho1 with pid 3384 completed with status 0
% 0.17/0.44 # Result found by post_as_ho1
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: HGHNF-FFSM00-SHSSMFNN
% 0.17/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.44 # new_ho_10 with pid 3389 completed with status 0
% 0.17/0.44 # Result found by new_ho_10
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: HGHNF-FFSM00-SHSSMFNN
% 0.17/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 29
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 26
% 0.17/0.44 # Removed in clause preprocessing : 14
% 0.17/0.44 # Initial clauses in saturation : 12
% 0.17/0.44 # Processed clauses : 32
% 0.17/0.44 # ...of these trivial : 0
% 0.17/0.44 # ...subsumed : 2
% 0.17/0.44 # ...remaining for further processing : 30
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 10
% 0.17/0.44 # Backward-rewritten : 5
% 0.17/0.44 # Generated clauses : 13
% 0.17/0.44 # ...of the previous two non-redundant : 12
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 6
% 0.17/0.44 # Paramodulations : 13
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Disequality decompositions : 0
% 0.17/0.44 # Total rewrite steps : 10
% 0.17/0.44 # ...of those cached : 7
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 5
% 0.17/0.44 # Positive orientable unit clauses : 3
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 0
% 0.17/0.44 # Non-unit-clauses : 2
% 0.17/0.44 # Current number of unprocessed clauses: 0
% 0.17/0.44 # ...number of literals in the above : 0
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 25
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 48
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 22
% 0.17/0.44 # Non-unit clause-clause subsumptions : 20
% 0.17/0.44 # Unit Clause-clause subsumption calls : 3
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 3
% 0.17/0.44 # BW rewrite match successes : 3
% 0.17/0.44 # Condensation attempts : 32
% 0.17/0.44 # Condensation successes : 2
% 0.17/0.44 # Termbank termtop insertions : 1583
% 0.17/0.44 # Search garbage collected termcells : 337
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.004 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.005 s
% 0.17/0.44 # Maximum resident set size: 1704 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.007 s
% 0.17/0.44 # System time : 0.002 s
% 0.17/0.44 # Total time : 0.008 s
% 0.17/0.44 # Maximum resident set size: 1788 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.44 % E exiting
%------------------------------------------------------------------------------