TSTP Solution File: SEU541^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU541^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:28:04 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 2 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 64 ( 10 ~; 6 |; 5 &; 36 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 7 ( 2 ^ 5 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
prop2set: $o > $i ).
thf(decl_25,type,
prop2setI: $o ).
thf(decl_26,type,
set2prop: $i > $o ).
thf(decl_27,type,
epred1_0: $o ).
thf(set2prop,axiom,
( set2prop
= ( ^ [X2: $i] : ( in @ emptyset @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set2prop) ).
thf(prop2set2propI,conjecture,
( prop2setI
=> ! [X1: $o] :
( X1
=> ( set2prop @ ( prop2set @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop2set2propI) ).
thf(prop2setI,axiom,
( prop2setI
<=> ! [X1: $o] :
( X1
=> ( in @ emptyset @ ( prop2set @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop2setI) ).
thf(c_0_3,plain,
( set2prop
= ( ^ [Z0: $i] : ( in @ emptyset @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[set2prop]) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X5: $o] :
( X5
=> ( in @ emptyset @ ( prop2set @ X5 ) ) )
=> ! [X1: $o] :
( X1
=> ( in @ emptyset @ ( prop2set @ X1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prop2set2propI]),c_0_3]),prop2setI]) ).
thf(c_0_5,negated_conjecture,
! [X6: $o] :
( ( ~ X6
| ( in @ emptyset @ ( prop2set @ X6 ) ) )
& epred1_0
& ( ~ epred1_0
| epred1_0 )
& ( ~ ( in @ emptyset @ ( prop2set @ $false ) )
| epred1_0 )
& ( ~ epred1_0
| ~ ( in @ emptyset @ ( prop2set @ $true ) ) )
& ( ~ ( in @ emptyset @ ( prop2set @ $false ) )
| ~ ( in @ emptyset @ ( prop2set @ $true ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[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,
( ~ epred1_0
| ~ ( in @ emptyset @ ( prop2set @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
in @ emptyset @ ( prop2set @ $true ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU541^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.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:47:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ho_unfolding_2 with 300s (1) cores
% 0.20/0.49 # post_as_ho5 with pid 16952 completed with status 0
% 0.20/0.49 # Result found by post_as_ho5
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.49 # Search class: HHHNF-FFSF11-SSFFMFNN
% 0.20/0.49 # partial match(1): HHUNF-FFSF11-SSFFMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 16956 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.49 # Search class: HHHNF-FFSF11-SSFFMFNN
% 0.20/0.49 # partial match(1): HHUNF-FFSF11-SSFFMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 8
% 0.20/0.49 # Removed by relevancy pruning/SinE : 5
% 0.20/0.49 # Initial clauses : 6
% 0.20/0.49 # Removed in clause preprocessing : 1
% 0.20/0.49 # Initial clauses in saturation : 5
% 0.20/0.49 # Processed clauses : 3
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 2
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 0
% 0.20/0.49 # ...of the previous two non-redundant : 0
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 2
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 2
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 4
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 0
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 3
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 353
% 0.20/0.49 # Search garbage collected termcells : 116
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.004 s
% 0.20/0.49 # Maximum resident set size: 1788 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------