TSTP Solution File: SEU768^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU768^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:30:05 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 7 unt; 11 typ; 0 def)
% Number of atoms : 84 ( 2 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 446 ( 40 ~; 45 |; 7 &; 327 @)
% ( 1 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 77 ( 4 ^ 73 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_24,type,
kpair: $i > $i > $i ).
thf(decl_26,type,
breln: $i > $i > $i > $o ).
thf(decl_27,type,
brelnall2: $o ).
thf(decl_28,type,
breln1: $i > $i > $o ).
thf(decl_29,type,
esk1_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_30,type,
esk2_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(decl_33,type,
epred1_0: $i > $o ).
thf(decl_34,type,
esk5_0: $i ).
thf(breln1,axiom,
( breln1
= ( ^ [X1: $i,X4: $i] : ( breln @ X1 @ X1 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1) ).
thf(breln1all2,conjecture,
( brelnall2
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1all2) ).
thf(brelnall2,axiom,
( brelnall2
<=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',brelnall2) ).
thf(c_0_3,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( breln @ Z0 @ Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[breln1]) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X21: $i,X22: $i,X23: $i] :
( ( breln @ X21 @ X22 @ X23 )
=> ! [X24: $i > $o] :
( ! [X25: $i] :
( ( in @ X25 @ X21 )
=> ! [X26: $i] :
( ( in @ X26 @ X22 )
=> ( ( in @ ( kpair @ X25 @ X26 ) @ X23 )
=> ( X24 @ ( kpair @ X25 @ X26 ) ) ) ) )
=> ! [X27: $i] :
( ( in @ X27 @ X23 )
=> ( X24 @ X27 ) ) ) )
=> ! [X1: $i,X4: $i] :
( ( breln @ X1 @ X1 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1all2]),brelnall2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X28: $i,X29: $i,X30: $i,X31: $i > $o,X34: $i,X38: $i,X39: $i] :
( ( ( in @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ X28 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( breln @ X28 @ X29 @ X30 ) )
& ( ( in @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) @ X29 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( breln @ X28 @ X29 @ X30 ) )
& ( ( in @ ( kpair @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) ) @ X30 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( breln @ X28 @ X29 @ X30 ) )
& ( ~ ( X31 @ ( kpair @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) ) )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( breln @ X28 @ X29 @ X30 ) )
& ( breln @ esk3_0 @ esk3_0 @ esk4_0 )
& ( ~ ( in @ X38 @ esk3_0 )
| ~ ( in @ X39 @ esk3_0 )
| ~ ( in @ ( kpair @ X38 @ X39 ) @ esk4_0 )
| ( epred1_0 @ ( kpair @ X38 @ X39 ) ) )
& ( in @ esk5_0 @ esk4_0 )
& ~ ( epred1_0 @ esk5_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_4])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) @ X3 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
in @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( X5 @ X4 )
| ~ ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i] :
( ( epred1_0 @ ( kpair @ X1 @ X2 ) )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) ) @ esk4_0 )
| ( X5 @ esk5_0 )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( X5 @ esk5_0 )
| ~ ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) ) )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( epred1_0 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) ) )
| ( X5 @ esk5_0 )
| ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ esk3_0 )
| ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ esk3_0 )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
~ ( epred1_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) @ X2 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ X2 )
| ( X5 @ esk5_0 )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ X1 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] :
( ~ ( in @ ( esk1_4 @ X1 @ esk3_0 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( breln @ X1 @ esk3_0 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ X1 )
| ( X5 @ esk5_0 )
| ~ ( breln @ X1 @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
thf(c_0_20,negated_conjecture,
breln @ esk3_0 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU768^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 18:06:23 EDT 2024
% 0.12/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.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNSSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.48 # new_bool_1 with pid 3614 completed with status 0
% 0.20/0.48 # Result found by new_bool_1
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNSSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: HGUNF-FFSF33-SSSFMMBN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48 # new_ho_10 with pid 3618 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNSSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: HGUNF-FFSF33-SSSFMMBN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 11
% 0.20/0.48 # Removed by relevancy pruning/SinE : 8
% 0.20/0.48 # Initial clauses : 8
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 8
% 0.20/0.48 # Processed clauses : 36
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 36
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 29
% 0.20/0.48 # ...of the previous two non-redundant : 28
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 29
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 1
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 28
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 25
% 0.20/0.48 # Current number of unprocessed clauses: 8
% 0.20/0.48 # ...number of literals in the above : 39
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 8
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 123
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 17
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 36
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2741
% 0.20/0.48 # Search garbage collected termcells : 425
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.009 s
% 0.20/0.48 # Maximum resident set size: 1892 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.009 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.012 s
% 0.20/0.48 # Maximum resident set size: 1760 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------