TSTP Solution File: SEU462^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU462^1 : 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 03:27:29 EDT 2024
% Result : Theorem 0.23s 0.50s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 40 ( 12 unt; 12 typ; 0 def)
% Number of atoms : 70 ( 7 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 364 ( 21 ~; 34 |; 22 &; 269 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 81 ( 81 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 76 ( 15 ^ 61 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_34,type,
trans: ( $i > $i > $o ) > $o ).
thf(decl_35,type,
tc: ( $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(decl_54,type,
epred2_0: $i > $i > $o ).
thf(decl_55,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(decl_56,type,
esk4_1: ( $i > $i > $o ) > $i ).
thf(decl_57,type,
esk5_1: ( $i > $i > $o ) > $i ).
thf(decl_58,type,
esk6_1: ( $i > $i > $o ) > $i ).
thf(decl_59,type,
esk7_1: ( $i > $i > $o ) > $i ).
thf(transitive_closure,axiom,
( tc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
! [X2: $i > $i > $o] :
( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 ) )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',transitive_closure) ).
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(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_closure_is_transitive2,conjecture,
! [X1: $i > $i > $o,X3: $i,X4: $i,X2: $i > $i > $o] :
( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 )
& ( tc @ X1 @ X3 @ X4 ) )
=> ( X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_closure_is_transitive2) ).
thf(c_0_4,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X13: $i,X14: $i,X15: $i] :
( ( ( X2 @ X13 @ X14 )
& ( X2 @ X14 @ X15 ) )
=> ( X2 @ X13 @ X15 ) )
& ! [X16: $i,X17: $i] :
( ( Z0 @ X16 @ X17 )
=> ( X2 @ X16 @ X17 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive_closure]) ).
thf(c_0_5,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_6,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_7,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X13: $i,X14: $i,X15: $i] :
( ( ( X2 @ X13 @ X14 )
& ( X2 @ X14 @ X15 ) )
=> ( X2 @ X13 @ X15 ) )
& ! [X16: $i,X17: $i] :
( ( Z0 @ X16 @ X17 )
=> ( X2 @ X16 @ X17 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
~ ! [X1: $i > $i > $o,X3: $i,X4: $i,X2: $i > $i > $o] :
( ( ! [X18: $i,X19: $i,X20: $i] :
( ( ( X2 @ X18 @ X19 )
& ( X2 @ X19 @ X20 ) )
=> ( X2 @ X18 @ X20 ) )
& ! [X21: $i,X22: $i] :
( ( X1 @ X21 @ X22 )
=> ( X2 @ X21 @ X22 ) )
& ! [X23: $i > $i > $o] :
( ( ! [X24: $i,X25: $i,X26: $i] :
( ( ( X23 @ X24 @ X25 )
& ( X23 @ X25 @ X26 ) )
=> ( X23 @ X24 @ X26 ) )
& ! [X27: $i,X28: $i] :
( ( X1 @ X27 @ X28 )
=> ( X23 @ X27 @ X28 ) ) )
=> ( X23 @ X3 @ X4 ) ) )
=> ( X2 @ X3 @ X4 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[transitive_closure_is_transitive2]),c_0_7]),c_0_5]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X38: $i > $i > $o] :
( ( ~ ( epred2_0 @ X33 @ X34 )
| ~ ( epred2_0 @ X34 @ X35 )
| ( epred2_0 @ X33 @ X35 ) )
& ( ~ ( epred1_0 @ X36 @ X37 )
| ( epred2_0 @ X36 @ X37 ) )
& ( ( epred1_0 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ( X38 @ ( esk3_1 @ X38 ) @ ( esk4_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X38 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ( X38 @ ( esk3_1 @ X38 ) @ ( esk4_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ( X38 @ ( esk4_1 @ X38 ) @ ( esk5_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X38 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ( X38 @ ( esk4_1 @ X38 ) @ ( esk5_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ~ ( X38 @ ( esk3_1 @ X38 ) @ ( esk5_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X38 @ ( esk6_1 @ X38 ) @ ( esk7_1 @ X38 ) )
| ~ ( X38 @ ( esk3_1 @ X38 ) @ ( esk5_1 @ X38 ) )
| ( X38 @ esk1_0 @ esk2_0 ) )
& ~ ( epred2_0 @ esk1_0 @ esk2_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_8])])])])])]) ).
thf(c_0_10,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_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ) )
| ( epred2_0 @ X3 @ ( esk5_1 @ epred2_0 ) )
| ~ ( epred2_0 @ X3 @ ( esk4_1 @ epred2_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,negated_conjecture,
( ( epred2_0 @ ( esk3_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) )
| ( epred1_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_18,negated_conjecture,
epred1_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_20,negated_conjecture,
epred2_0 @ ( esk6_1 @ epred2_0 ) @ ( esk7_1 @ epred2_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ X3 @ ( esk5_1 @ epred2_0 ) )
| ~ ( epred2_0 @ X3 @ ( esk4_1 @ epred2_0 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
thf(c_0_24,negated_conjecture,
epred2_0 @ ( esk3_1 @ epred2_0 ) @ ( esk4_1 @ epred2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_12]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_26,negated_conjecture,
epred2_0 @ ( esk3_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU462^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:45:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.48 Running higher-order theorem proving
% 0.23/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.23/0.50 # Version: 3.1.0-ho
% 0.23/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.23/0.50 # new_bool_1 with pid 5026 completed with status 0
% 0.23/0.50 # Result found by new_bool_1
% 0.23/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.50 # Search class: HGUNF-FFSF11-SHSSMMBN
% 0.23/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.50 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.23/0.50 # ehoh_best2_full_lfho with pid 5029 completed with status 0
% 0.23/0.50 # Result found by ehoh_best2_full_lfho
% 0.23/0.50 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.50 # Search class: HGUNF-FFSF11-SHSSMMBN
% 0.23/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.50 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.23/0.50 # Preprocessing time : 0.001 s
% 0.23/0.50
% 0.23/0.50 # Proof found!
% 0.23/0.50 # SZS status Theorem
% 0.23/0.50 # SZS output start CNFRefutation
% See solution above
% 0.23/0.50 # Parsed axioms : 59
% 0.23/0.50 # Removed by relevancy pruning/SinE : 55
% 0.23/0.50 # Initial clauses : 9
% 0.23/0.50 # Removed in clause preprocessing : 0
% 0.23/0.50 # Initial clauses in saturation : 9
% 0.23/0.50 # Processed clauses : 25
% 0.23/0.50 # ...of these trivial : 0
% 0.23/0.50 # ...subsumed : 0
% 0.23/0.50 # ...remaining for further processing : 25
% 0.23/0.50 # Other redundant clauses eliminated : 0
% 0.23/0.50 # Clauses deleted for lack of memory : 0
% 0.23/0.50 # Backward-subsumed : 0
% 0.23/0.50 # Backward-rewritten : 3
% 0.23/0.50 # Generated clauses : 79
% 0.23/0.50 # ...of the previous two non-redundant : 61
% 0.23/0.50 # ...aggressively subsumed : 0
% 0.23/0.50 # Contextual simplify-reflections : 0
% 0.23/0.50 # Paramodulations : 24
% 0.23/0.50 # Factorizations : 0
% 0.23/0.50 # NegExts : 0
% 0.23/0.50 # Equation resolutions : 0
% 0.23/0.50 # Disequality decompositions : 0
% 0.23/0.50 # Total rewrite steps : 5
% 0.23/0.50 # ...of those cached : 3
% 0.23/0.50 # Propositional unsat checks : 0
% 0.23/0.50 # Propositional check models : 0
% 0.23/0.50 # Propositional check unsatisfiable : 0
% 0.23/0.50 # Propositional clauses : 0
% 0.23/0.50 # Propositional clauses after purity: 0
% 0.23/0.50 # Propositional unsat core size : 0
% 0.23/0.50 # Propositional preprocessing time : 0.000
% 0.23/0.50 # Propositional encoding time : 0.000
% 0.23/0.50 # Propositional solver time : 0.000
% 0.23/0.50 # Success case prop preproc time : 0.000
% 0.23/0.50 # Success case prop encoding time : 0.000
% 0.23/0.50 # Success case prop solver time : 0.000
% 0.23/0.50 # Current number of processed clauses : 20
% 0.23/0.50 # Positive orientable unit clauses : 5
% 0.23/0.50 # Positive unorientable unit clauses: 0
% 0.23/0.50 # Negative unit clauses : 1
% 0.23/0.50 # Non-unit-clauses : 14
% 0.23/0.50 # Current number of unprocessed clauses: 44
% 0.23/0.50 # ...number of literals in the above : 128
% 0.23/0.50 # Current number of archived formulas : 0
% 0.23/0.50 # Current number of archived clauses : 5
% 0.23/0.50 # Clause-clause subsumption calls (NU) : 31
% 0.23/0.50 # Rec. Clause-clause subsumption calls : 29
% 0.23/0.50 # Non-unit clause-clause subsumptions : 0
% 0.23/0.50 # Unit Clause-clause subsumption calls : 0
% 0.23/0.50 # Rewrite failures with RHS unbound : 0
% 0.23/0.50 # BW rewrite match attempts : 1
% 0.23/0.50 # BW rewrite match successes : 1
% 0.23/0.50 # Condensation attempts : 0
% 0.23/0.50 # Condensation successes : 0
% 0.23/0.50 # Termbank termtop insertions : 4169
% 0.23/0.50 # Search garbage collected termcells : 681
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.005 s
% 0.23/0.50 # System time : 0.004 s
% 0.23/0.50 # Total time : 0.009 s
% 0.23/0.50 # Maximum resident set size: 1908 pages
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.006 s
% 0.23/0.50 # System time : 0.007 s
% 0.23/0.50 # Total time : 0.013 s
% 0.23/0.50 # Maximum resident set size: 1792 pages
% 0.23/0.50 % E---3.1 exiting
% 0.23/0.50 % E exiting
%------------------------------------------------------------------------------