TSTP Solution File: SEU787^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU787^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:15 EDT 2024
% Result : Theorem 0.10s 0.36s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 71 ( 0 equ; 0 cnn)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 275 ( 23 ~; 21 |; 8 &; 192 @)
% ( 1 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 9 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 : 33 ( 0 ^ 33 !; 0 ?; 33 :)
% 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,
breln1unionE: $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
esk4_0: $i ).
thf(decl_31,type,
esk5_0: $i ).
thf(decl_32,type,
epred1_0: $o ).
thf(breln1unionEcases,conjecture,
( breln1unionE
=> ! [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 ) @ ( binunion @ X2 @ X3 ) )
=> ! [X6: $o] :
( ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
=> X6 )
=> ( ( ( in @ ( kpair @ X4 @ X5 ) @ X3 )
=> X6 )
=> X6 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionEcases) ).
thf(breln1unionE,axiom,
( breln1unionE
<=> ! [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 ) @ ( binunion @ X2 @ X3 ) )
=> ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
| ( in @ ( kpair @ X4 @ X5 ) @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionE) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X18: $i,X19: $i] :
( ( breln1 @ X18 @ X19 )
=> ! [X20: $i] :
( ( breln1 @ X18 @ X20 )
=> ! [X21: $i] :
( ( in @ X21 @ X18 )
=> ! [X22: $i] :
( ( in @ X22 @ X18 )
=> ( ( in @ ( kpair @ X21 @ X22 ) @ ( binunion @ X19 @ X20 ) )
=> ( ( in @ ( kpair @ X21 @ X22 ) @ X19 )
| ( in @ ( kpair @ X21 @ X22 ) @ X20 ) ) ) ) ) ) )
=> ! [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 ) @ ( binunion @ X2 @ X3 ) )
=> ! [X6: $o] :
( ( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
=> X6 )
=> ( ( ( in @ ( kpair @ X4 @ X5 ) @ X3 )
=> X6 )
=> X6 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1unionEcases]),breln1unionE]) ).
thf(c_0_3,negated_conjecture,
! [X23: $i,X24: $i,X25: $i,X26: $i,X27: $i] :
( ( ~ ( breln1 @ X23 @ X24 )
| ~ ( breln1 @ X23 @ X25 )
| ~ ( in @ X26 @ X23 )
| ~ ( in @ X27 @ X23 )
| ~ ( in @ ( kpair @ X26 @ X27 ) @ ( binunion @ X24 @ X25 ) )
| ( in @ ( kpair @ X26 @ X27 ) @ X24 )
| ( in @ ( kpair @ X26 @ X27 ) @ X25 ) )
& ( 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 ) @ ( binunion @ esk2_0 @ esk3_0 ) )
& ( ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 )
| epred1_0 )
& ( ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 )
| epred1_0 )
& ~ epred1_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_2])])])])]) ).
thf(c_0_4,negated_conjecture,
( epred1_0
| ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
~ epred1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( epred1_0
| ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
| ( in @ ( kpair @ X4 @ X5 ) @ X3 )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk3_0 ),
inference(sr,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_10,negated_conjecture,
~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 ),
inference(sr,[status(thm)],[c_0_6,c_0_5]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ~ ( in @ esk5_0 @ X1 )
| ~ ( in @ esk4_0 @ X1 )
| ~ ( breln1 @ X1 @ esk3_0 )
| ~ ( breln1 @ X1 @ esk2_0 ) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
breln1 @ esk1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
in @ esk5_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
in @ esk4_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,negated_conjecture,
breln1 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEU787^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n013.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 16:26:07 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.35 Running higher-order theorem proving
% 0.10/0.35 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.10/0.36 # Version: 3.1.0-ho
% 0.10/0.36 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_10 with 1500s (5) cores
% 0.10/0.36 # Starting sh5l with 300s (1) cores
% 0.10/0.36 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.10/0.36 # Starting lpo1_def_fix with 300s (1) cores
% 0.10/0.36 # ehoh_best_sine_rwall with pid 32428 completed with status 0
% 0.10/0.36 # Result found by ehoh_best_sine_rwall
% 0.10/0.36 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_10 with 1500s (5) cores
% 0.10/0.36 # Starting sh5l with 300s (1) cores
% 0.10/0.36 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.10/0.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.36 # Search class: HGUNF-FFSS22-SFFFMFNN
% 0.10/0.36 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.36 # Starting new_ho_10 with 163s (1) cores
% 0.10/0.36 # new_ho_10 with pid 32431 completed with status 0
% 0.10/0.36 # Result found by new_ho_10
% 0.10/0.36 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting new_ho_10 with 1500s (5) cores
% 0.10/0.36 # Starting sh5l with 300s (1) cores
% 0.10/0.36 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.10/0.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.36 # Search class: HGUNF-FFSS22-SFFFMFNN
% 0.10/0.36 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.36 # Starting new_ho_10 with 163s (1) cores
% 0.10/0.36 # Preprocessing time : 0.001 s
% 0.10/0.36 # Presaturation interreduction done
% 0.10/0.36
% 0.10/0.36 # Proof found!
% 0.10/0.36 # SZS status Theorem
% 0.10/0.36 # SZS output start CNFRefutation
% See solution above
% 0.10/0.36 # Parsed axioms : 7
% 0.10/0.36 # Removed by relevancy pruning/SinE : 5
% 0.10/0.36 # Initial clauses : 9
% 0.10/0.36 # Removed in clause preprocessing : 0
% 0.10/0.36 # Initial clauses in saturation : 9
% 0.10/0.36 # Processed clauses : 19
% 0.10/0.36 # ...of these trivial : 0
% 0.10/0.36 # ...subsumed : 0
% 0.10/0.36 # ...remaining for further processing : 19
% 0.10/0.36 # Other redundant clauses eliminated : 0
% 0.10/0.36 # Clauses deleted for lack of memory : 0
% 0.10/0.36 # Backward-subsumed : 0
% 0.10/0.36 # Backward-rewritten : 0
% 0.10/0.36 # Generated clauses : 2
% 0.10/0.36 # ...of the previous two non-redundant : 1
% 0.10/0.36 # ...aggressively subsumed : 0
% 0.10/0.36 # Contextual simplify-reflections : 0
% 0.10/0.36 # Paramodulations : 2
% 0.10/0.36 # Factorizations : 0
% 0.10/0.36 # NegExts : 0
% 0.10/0.36 # Equation resolutions : 0
% 0.10/0.36 # Disequality decompositions : 0
% 0.10/0.36 # Total rewrite steps : 3
% 0.10/0.36 # ...of those cached : 0
% 0.10/0.36 # Propositional unsat checks : 0
% 0.10/0.36 # Propositional check models : 0
% 0.10/0.36 # Propositional check unsatisfiable : 0
% 0.10/0.36 # Propositional clauses : 0
% 0.10/0.36 # Propositional clauses after purity: 0
% 0.10/0.36 # Propositional unsat core size : 0
% 0.10/0.36 # Propositional preprocessing time : 0.000
% 0.10/0.36 # Propositional encoding time : 0.000
% 0.10/0.36 # Propositional solver time : 0.000
% 0.10/0.36 # Success case prop preproc time : 0.000
% 0.10/0.36 # Success case prop encoding time : 0.000
% 0.10/0.36 # Success case prop solver time : 0.000
% 0.10/0.36 # Current number of processed clauses : 10
% 0.10/0.36 # Positive orientable unit clauses : 5
% 0.10/0.36 # Positive unorientable unit clauses: 0
% 0.10/0.36 # Negative unit clauses : 3
% 0.10/0.36 # Non-unit-clauses : 2
% 0.10/0.36 # Current number of unprocessed clauses: 0
% 0.10/0.36 # ...number of literals in the above : 0
% 0.10/0.36 # Current number of archived formulas : 0
% 0.10/0.36 # Current number of archived clauses : 9
% 0.10/0.36 # Clause-clause subsumption calls (NU) : 6
% 0.10/0.36 # Rec. Clause-clause subsumption calls : 0
% 0.10/0.36 # Non-unit clause-clause subsumptions : 0
% 0.10/0.36 # Unit Clause-clause subsumption calls : 2
% 0.10/0.36 # Rewrite failures with RHS unbound : 0
% 0.10/0.36 # BW rewrite match attempts : 0
% 0.10/0.36 # BW rewrite match successes : 0
% 0.10/0.36 # Condensation attempts : 19
% 0.10/0.36 # Condensation successes : 0
% 0.10/0.36 # Termbank termtop insertions : 1134
% 0.10/0.36 # Search garbage collected termcells : 345
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.003 s
% 0.10/0.36 # System time : 0.001 s
% 0.10/0.36 # Total time : 0.005 s
% 0.10/0.36 # Maximum resident set size: 1892 pages
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.004 s
% 0.10/0.36 # System time : 0.004 s
% 0.10/0.36 # Total time : 0.007 s
% 0.10/0.36 # Maximum resident set size: 1700 pages
% 0.10/0.36 % E---3.1 exiting
% 0.10/0.37 % E exiting
%------------------------------------------------------------------------------