TSTP Solution File: SEU474^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 03:27:32 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 21 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 69 ( 30 equ; 0 cnn)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 169 ( 34 ~; 38 |; 12 &; 84 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 16 ( 12 ^ 4 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_33,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_51,type,
epred1_0: $i > $i > $o ).
thf(decl_52,type,
esk1_0: $i ).
thf(decl_53,type,
esk2_0: $i ).
thf(reflexive_closure,axiom,
( rc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
( ( X3 = X4 )
| ( X1 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',reflexive_closure) ).
thf(symmetric_closure,axiom,
( sc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
( ( X1 @ X4 @ X3 )
| ( X1 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',symmetric_closure) ).
thf(composing_symmetric_closure_and_reflexive_closure,conjecture,
! [X1: $i > $i > $o] :
( ( sc @ ( rc @ X1 ) )
= ( rc @ ( sc @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composing_symmetric_closure_and_reflexive_closure) ).
thf(c_0_3,plain,
( rc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
( ( Z1 = Z2 )
| ( Z0 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[reflexive_closure]) ).
thf(c_0_4,plain,
( sc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
( ( Z0 @ Z2 @ Z1 )
| ( Z0 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[symmetric_closure]) ).
thf(c_0_5,negated_conjecture,
~ ! [X1: $i > $i > $o,X158: $i,X159: $i] :
( ( ( X159 = X158 )
| ( X1 @ X159 @ X158 )
| ( X158 = X159 )
| ( X1 @ X158 @ X159 ) )
<=> ( ( X158 = X159 )
| ( X1 @ X159 @ X158 )
| ( X1 @ X158 @ X159 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[composing_symmetric_closure_and_reflexive_closure]),c_0_3]),c_0_4])]) ).
thf(c_0_6,negated_conjecture,
( ( ( esk1_0 != esk2_0 )
| ( esk2_0 != esk1_0 ) )
& ( ~ ( epred1_0 @ esk2_0 @ esk1_0 )
| ( esk2_0 != esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk2_0 != esk1_0 ) )
& ( ( esk1_0 != esk2_0 )
| ~ ( epred1_0 @ esk2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 @ esk1_0 ) )
& ( ( esk1_0 != esk2_0 )
| ( esk1_0 != esk2_0 ) )
& ( ~ ( epred1_0 @ esk2_0 @ esk1_0 )
| ( esk1_0 != esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 != esk2_0 ) )
& ( ( esk1_0 != esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ( esk2_0 = esk1_0 )
| ( epred1_0 @ esk2_0 @ esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 @ esk2_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_5])])])])]) ).
thf(c_0_7,negated_conjecture,
( ( esk2_0 = esk1_0 )
| ( epred1_0 @ esk2_0 @ esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
( ( esk1_0 != esk2_0 )
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ~ ( epred1_0 @ esk2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( esk2_0 = esk1_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0 @ esk1_0 @ esk2_0 ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
~ ( epred1_0 @ esk2_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU474^1 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:58:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting sh1l with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.49 # post_as_ho1 with pid 21601 completed with status 0
% 0.20/0.49 # Result found by post_as_ho1
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 21607 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 59
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 42
% 0.20/0.49 # Removed in clause preprocessing : 29
% 0.20/0.49 # Initial clauses in saturation : 13
% 0.20/0.49 # Processed clauses : 10
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 6
% 0.20/0.49 # ...remaining for further processing : 3
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 0
% 0.20/0.49 # ...of the previous two non-redundant : 0
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 3
% 0.20/0.49 # Positive orientable unit clauses : 0
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 3
% 0.20/0.49 # ...number of literals in the above : 6
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 0
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 10
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3228
% 0.20/0.49 # Search garbage collected termcells : 741
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 2160 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1792 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------