TSTP Solution File: SEU785^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU785^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:14 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 8 unt; 11 typ; 0 def)
% Number of atoms : 93 ( 0 equ; 0 cnn)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 379 ( 32 ~; 32 |; 7 &; 272 @)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 56 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
binunion: $i > $i > $i ).
thf(decl_24,type,
kpair: $i > $i > $i ).
thf(decl_25,type,
breln1: $i > $i > $o ).
thf(decl_26,type,
breln1unionIL: $o ).
thf(decl_27,type,
breln1unionIR: $o ).
thf(decl_28,type,
esk1_0: $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(decl_31,type,
esk4_0: $i ).
thf(decl_32,type,
esk5_0: $i ).
thf(breln1unionI,conjecture,
( breln1unionIL
=> ( breln1unionIR
=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ( ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
| ( in @ ( kpair @ X4 @ X5 ) @ X3 ) )
=> ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionI) ).
thf(breln1unionIR,axiom,
( breln1unionIR
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ( ( in @ ( kpair @ X4 @ X5 ) @ X3 )
=> ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionIR) ).
thf(breln1unionIL,axiom,
( breln1unionIL
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
=> ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionIL) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X21: $i,X22: $i] :
( ( breln1 @ X21 @ X22 )
=> ! [X23: $i] :
( ( breln1 @ X21 @ X23 )
=> ! [X24: $i] :
( ( in @ X24 @ X21 )
=> ! [X25: $i] :
( ( in @ X25 @ X21 )
=> ( ( in @ ( kpair @ X24 @ X25 ) @ X22 )
=> ( in @ ( kpair @ X24 @ X25 ) @ ( binunion @ X22 @ X23 ) ) ) ) ) ) )
=> ( ! [X26: $i,X27: $i] :
( ( breln1 @ X26 @ X27 )
=> ! [X28: $i] :
( ( breln1 @ X26 @ X28 )
=> ! [X29: $i] :
( ( in @ X29 @ X26 )
=> ! [X30: $i] :
( ( in @ X30 @ X26 )
=> ( ( in @ ( kpair @ X29 @ X30 ) @ X28 )
=> ( in @ ( kpair @ X29 @ X30 ) @ ( binunion @ X27 @ X28 ) ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ( ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
| ( in @ ( kpair @ X4 @ X5 ) @ X3 ) )
=> ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1unionI]),breln1unionIR]),breln1unionIL]) ).
thf(c_0_4,negated_conjecture,
! [X31: $i,X32: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $i,X40: $i] :
( ( ~ ( breln1 @ X31 @ X32 )
| ~ ( breln1 @ X31 @ X33 )
| ~ ( in @ X34 @ X31 )
| ~ ( in @ X35 @ X31 )
| ~ ( in @ ( kpair @ X34 @ X35 ) @ X32 )
| ( in @ ( kpair @ X34 @ X35 ) @ ( binunion @ X32 @ X33 ) ) )
& ( ~ ( breln1 @ X36 @ X37 )
| ~ ( breln1 @ X36 @ X38 )
| ~ ( in @ X39 @ X36 )
| ~ ( in @ X40 @ X36 )
| ~ ( in @ ( kpair @ X39 @ X40 ) @ X38 )
| ( in @ ( kpair @ X39 @ X40 ) @ ( binunion @ X37 @ X38 ) ) )
& ( breln1 @ esk1_0 @ esk2_0 )
& ( breln1 @ esk1_0 @ esk3_0 )
& ( in @ esk4_0 @ esk1_0 )
& ( in @ esk5_0 @ esk1_0 )
& ( ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 )
| ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 ) )
& ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ) ) ),
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_3])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i,X1: $i,X5: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
breln1 @ esk1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ esk3_0 ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk3_0 )
| ~ ( in @ X2 @ esk1_0 )
| ~ ( in @ X1 @ esk1_0 )
| ~ ( breln1 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
in @ esk5_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
in @ esk4_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
breln1 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i,X5: $i,X4: $i,X2: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,negated_conjecture,
( ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 )
| ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ esk3_0 ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ X3 )
| ~ ( in @ X2 @ esk1_0 )
| ~ ( in @ X1 @ esk1_0 )
| ~ ( breln1 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
thf(c_0_16,negated_conjecture,
in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_9]),c_0_10]),c_0_11])]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU785^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n005.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 17:46:07 EDT 2024
% 0.10/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: HSSSSLSSSLSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.45 # Starting post_as_ho3 with 300s (1) cores
% 0.17/0.45 # Starting post_as_ho2 with 300s (1) cores
% 0.17/0.45 # post_as_ho8 with pid 14912 completed with status 0
% 0.17/0.45 # Result found by post_as_ho8
% 0.17/0.45 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.17/0.45 # Search class: HGUNF-FFSS22-SFFFMFNN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.45 # new_ho_10 with pid 14915 completed with status 0
% 0.17/0.45 # Result found by new_ho_10
% 0.17/0.45 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.17/0.45 # Search class: HGUNF-FFSS22-SFFFMFNN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10 with 163s (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 : 9
% 0.17/0.45 # Removed by relevancy pruning/SinE : 6
% 0.17/0.45 # Initial clauses : 8
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 8
% 0.17/0.45 # Processed clauses : 23
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 22
% 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 : 0
% 0.17/0.45 # Generated clauses : 7
% 0.17/0.45 # ...of the previous two non-redundant : 7
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 6
% 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 : 7
% 0.17/0.45 # ...of those cached : 3
% 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 : 13
% 0.17/0.45 # Positive orientable unit clauses : 5
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 2
% 0.17/0.45 # Non-unit-clauses : 6
% 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 : 9
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 20
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 6
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 7
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 23
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 1626
% 0.17/0.45 # Search garbage collected termcells : 435
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.002 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1888 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.004 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1700 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------