TSTP Solution File: SET612^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET612^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:54:55 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 69 ( 7 equ; 0 cnn)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 165 ( 33 ~; 32 |; 20 &; 79 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 25 ( 18 ^ 7 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_27,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_29,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $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(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(intersection,axiom,
( intersection
= ( ^ [X9: $i > $o,X10: $i > $o,X4: $i] :
( ( X9 @ X4 )
& ( X10 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',intersection) ).
thf(setminus,axiom,
( setminus
= ( ^ [X11: $i > $o,X12: $i > $o,X4: $i] :
( ( X11 @ X4 )
& ~ ( X12 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',setminus) ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( setminus @ X22 @ ( union @ X23 @ X24 ) )
= ( intersection @ ( setminus @ X22 @ X23 ) @ ( setminus @ X22 @ X24 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_4,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_5,plain,
( intersection
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[intersection]) ).
thf(c_0_6,plain,
( setminus
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[setminus]) ).
thf(c_0_7,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o,X28: $i] :
( ( ( X22 @ X28 )
& ~ ( ( X23 @ X28 )
| ( X24 @ X28 ) ) )
<=> ( ( X22 @ X28 )
& ~ ( X23 @ X28 )
& ( X22 @ X28 )
& ~ ( X24 @ X28 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_4]),c_0_5]),c_0_6])]) ).
thf(c_0_8,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
epred1_0 @ esk1_0,
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET612^3 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:31:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting sh1l with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.50 # post_as_ho1 with pid 11987 completed with status 0
% 0.21/0.50 # Result found by post_as_ho1
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # new_ho_10 with pid 11992 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 29
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 27
% 0.21/0.50 # Removed in clause preprocessing : 14
% 0.21/0.50 # Initial clauses in saturation : 13
% 0.21/0.50 # Processed clauses : 13
% 0.21/0.50 # ...of these trivial : 7
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 3
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 0
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 0
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 8
% 0.21/0.50 # ...of those cached : 7
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 3
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 0
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 13
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1274
% 0.21/0.50 # Search garbage collected termcells : 241
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1776 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1752 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------