TSTP Solution File: SET580^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET580^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:21 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 80 ( 2 equ; 0 cnn)
% Maximal formula atoms : 48 ( 5 avg)
% Number of connectives : 215 ( 46 ~; 55 |; 17 &; 93 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 12 ( 6 ^ 6 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
excl_union: ( $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,
esk1_0: $i ).
thf(excl_union,axiom,
( excl_union
= ( ^ [X7: $i > $o,X8: $i > $o,X4: $i] :
( ( ( X7 @ X4 )
& ~ ( X8 @ X4 ) )
| ( ~ ( X7 @ X4 )
& ( X8 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',excl_union) ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X4: $i] :
( ( excl_union @ X22 @ X23 @ X4 )
<=> ( ( X22 @ X4 )
<=> ~ ( X23 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_2,plain,
( excl_union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( ( Z0 @ Z2 )
& ~ ( Z1 @ Z2 ) )
| ( ~ ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[excl_union]) ).
thf(c_0_3,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X4: $i] :
( ( ( ( X22 @ X4 )
& ~ ( X23 @ X4 ) )
| ( ~ ( X22 @ X4 )
& ( X23 @ X4 ) ) )
<=> ( ( X22 @ X4 )
<=> ~ ( X23 @ X4 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_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 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred2_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_3])])])])]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET580^3 : TPTP v8.2.0. Released v3.6.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.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:46:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.17/0.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSSSSMSSMLSNHSA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_2 with 300s (1) cores
% 0.17/0.45 # sh5l with pid 8635 completed with status 0
% 0.17/0.45 # Result found by sh5l
% 0.17/0.45 # Preprocessing class: HSSSSMSSMLSNHSA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.45 # new_ho_10 with pid 8638 completed with status 0
% 0.17/0.45 # Result found by new_ho_10
% 0.17/0.45 # Preprocessing class: HSSSSMSSMLSNHSA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 29
% 0.17/0.45 # Removed by relevancy pruning/SinE : 27
% 0.17/0.45 # Initial clauses : 12
% 0.17/0.45 # Removed in clause preprocessing : 8
% 0.17/0.45 # Initial clauses in saturation : 4
% 0.17/0.45 # Processed clauses : 4
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 3
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 1
% 0.17/0.45 # Generated clauses : 0
% 0.17/0.45 # ...of the previous two non-redundant : 0
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 1
% 0.17/0.45 # Paramodulations : 0
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 3
% 0.17/0.45 # ...of those cached : 2
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 2
% 0.17/0.45 # Positive orientable unit clauses : 1
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 0
% 0.17/0.45 # ...number of literals in the above : 0
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 1
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 1
% 0.17/0.45 # Non-unit clause-clause subsumptions : 1
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 1
% 0.17/0.45 # BW rewrite match successes : 1
% 0.17/0.45 # Condensation attempts : 4
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 912
% 0.17/0.45 # Search garbage collected termcells : 277
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.002 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.004 s
% 0.17/0.45 # Maximum resident set size: 1740 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.005 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.007 s
% 0.17/0.45 # Maximum resident set size: 1756 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------