TSTP Solution File: SEU738^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU738^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:29:42 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 16 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 28 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 101 ( 9 ~; 2 |; 5 &; 72 @)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
binunion: $i > $i > $i ).
thf(decl_25,type,
binunionIL: $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
esk3_0: $i ).
thf(decl_29,type,
esk4_0: $i ).
thf(binunionTILcontra,conjecture,
( binunionIL
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ ( binunion @ X4 @ X5 ) )
=> ~ ( in @ X3 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTILcontra) ).
thf(binunionIL,axiom,
( binunionIL
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ ( binunion @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X13: $i,X14: $i,X15: $i] :
( ( in @ X15 @ X13 )
=> ( in @ X15 @ ( binunion @ X13 @ X14 ) ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ ( binunion @ X4 @ X5 ) )
=> ~ ( in @ X3 @ X4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binunionTILcontra]),binunionIL])]) ).
thf(c_0_3,negated_conjecture,
! [X16: $i,X17: $i,X18: $i] :
( ( ~ ( in @ X18 @ X16 )
| ( in @ X18 @ ( binunion @ X16 @ X17 ) ) )
& ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk4_0 @ esk1_0 )
& ~ ( in @ esk4_0 @ ( binunion @ esk2_0 @ esk3_0 ) )
& ( in @ esk4_0 @ esk2_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,
~ ( in @ esk4_0 @ ( binunion @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ ( binunion @ X2 @ X3 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
in @ esk4_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU738^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:18:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.21/0.50 # Starting lpo1_def_fix with 300s (1) cores
% 0.21/0.50 # sh5l with pid 23887 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: HHUNF-FFSS21-SFFFMFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # new_ho_10 with pid 23892 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: HHUNF-FFSS21-SFFFMFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 6
% 0.21/0.50 # Removed by relevancy pruning/SinE : 4
% 0.21/0.50 # Initial clauses : 6
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 6
% 0.21/0.50 # Processed clauses : 12
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 12
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 1
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 1
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 1
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 6
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 1
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 6
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 12
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 443
% 0.21/0.50 # Search garbage collected termcells : 166
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1768 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------