TSTP Solution File: SEU465^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU465^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:30 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 38 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 78 ( 4 equ; 0 cnn)
% Maximal formula atoms : 24 ( 2 avg)
% Number of connectives : 277 ( 26 ~; 37 |; 18 &; 184 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 6 ^ 39 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_34,type,
trans: ( $i > $i > $o ) > $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(decl_54,type,
epred2_0: $i > $i > $o ).
thf(decl_55,type,
esk3_0: $i ).
thf(decl_56,type,
esk4_0: $i ).
thf(decl_57,type,
esk5_0: $i ).
thf(decl_58,type,
esk6_0: $i ).
thf(decl_59,type,
esk7_0: $i ).
thf(subrel,axiom,
( subrel
= ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',subrel) ).
thf(transitive,axiom,
( trans
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X6 ) )
=> ( X1 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',transitive) ).
thf(transitive_closure_is_transitive5,conjecture,
! [X1: $i > $i > $o,X3: $i,X4: $i,X2: $i > $i > $o] :
( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 )
& ( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 ) )
=> ( X2 @ X3 @ X4 ) ) )
=> ( X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_closure_is_transitive5) ).
thf(c_0_3,plain,
( subrel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( Z0 @ X3 @ X4 )
=> ( Z1 @ X3 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subrel]) ).
thf(c_0_4,plain,
( trans
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X6 ) )
=> ( Z0 @ X3 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_5,negated_conjecture,
~ ! [X1: $i > $i > $o,X3: $i,X4: $i,X2: $i > $i > $o] :
( ( ! [X42: $i,X43: $i,X44: $i] :
( ( ( X2 @ X42 @ X43 )
& ( X2 @ X43 @ X44 ) )
=> ( X2 @ X42 @ X44 ) )
& ! [X45: $i,X46: $i] :
( ( X1 @ X45 @ X46 )
=> ( X2 @ X45 @ X46 ) )
& ( ( ! [X47: $i,X48: $i,X49: $i] :
( ( ( X2 @ X47 @ X48 )
& ( X2 @ X48 @ X49 ) )
=> ( X2 @ X47 @ X49 ) )
& ! [X50: $i,X51: $i] :
( ( X1 @ X50 @ X51 )
=> ( X2 @ X50 @ X51 ) ) )
=> ( X2 @ X3 @ X4 ) ) )
=> ( X2 @ X3 @ X4 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[transitive_closure_is_transitive5]),c_0_3]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X56: $i,X57: $i,X58: $i,X59: $i,X60: $i] :
( ( ~ ( epred2_0 @ X56 @ X57 )
| ~ ( epred2_0 @ X57 @ X58 )
| ( epred2_0 @ X56 @ X58 ) )
& ( ~ ( epred1_0 @ X59 @ X60 )
| ( epred2_0 @ X59 @ X60 ) )
& ( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk4_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk4_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred2_0 @ esk3_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk6_0 @ esk7_0 )
| ~ ( epred2_0 @ esk3_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) )
& ~ ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(distribute,[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 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk4_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk4_0 @ esk5_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk3_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 )
| ~ ( epred2_0 @ esk3_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
( ( epred2_0 @ esk4_0 @ esk5_0 )
| ( epred1_0 @ esk6_0 @ esk7_0 ) ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_14,negated_conjecture,
( ( epred2_0 @ esk4_0 @ esk5_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 ) ),
inference(sr,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk7_0 )
| ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk7_0 )
| ~ ( epred2_0 @ esk3_0 @ esk5_0 ) ),
inference(sr,[status(thm)],[c_0_10,c_0_8]) ).
thf(c_0_18,negated_conjecture,
( ~ ( epred2_0 @ esk3_0 @ esk5_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 ) ),
inference(sr,[status(thm)],[c_0_11,c_0_8]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i,X4: $i,X6: $i] :
( ( epred2_0 @ X3 @ X6 )
| ~ ( epred2_0 @ X3 @ X4 )
| ~ ( epred2_0 @ X4 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_20,negated_conjecture,
epred2_0 @ esk4_0 @ esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_21,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk6_0 @ esk7_0 ) ),
inference(sr,[status(thm)],[c_0_15,c_0_8]) ).
thf(c_0_22,negated_conjecture,
( ( epred2_0 @ esk3_0 @ esk4_0 )
| ~ ( epred2_0 @ esk6_0 @ esk7_0 ) ),
inference(sr,[status(thm)],[c_0_16,c_0_8]) ).
thf(c_0_23,negated_conjecture,
~ ( epred2_0 @ esk3_0 @ esk5_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ X3 @ esk5_0 )
| ~ ( epred2_0 @ X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,negated_conjecture,
epred2_0 @ esk3_0 @ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_22]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU465^1 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 15:45:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # new_bool_2 with pid 13008 completed with status 0
% 0.20/0.50 # Result found by new_bool_2
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 13010 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 59
% 0.20/0.50 # Removed by relevancy pruning/SinE : 51
% 0.20/0.50 # Initial clauses : 9
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 9
% 0.20/0.50 # Processed clauses : 23
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 23
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 4
% 0.20/0.50 # Backward-rewritten : 2
% 0.20/0.50 # Generated clauses : 10
% 0.20/0.50 # ...of the previous two non-redundant : 8
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 3
% 0.20/0.50 # Paramodulations : 10
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 8
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 3
% 0.20/0.50 # ...number of literals in the above : 9
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 15
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 22
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 22
% 0.20/0.50 # Non-unit clause-clause subsumptions : 3
% 0.20/0.50 # Unit Clause-clause subsumption calls : 4
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 23
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1804
% 0.20/0.50 # Search garbage collected termcells : 652
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1916 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1784 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------