TSTP Solution File: SEU828^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU828^1 : 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:37 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 67 ( 19 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 73 ( 24 ~; 11 |; 2 &; 28 @)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 26 ^ 13 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
seteq: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(decl_23,type,
subseteq: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_24,type,
powerset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
emptyset: $i > $o ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(poserset,axiom,
( powerset
= ( ^ [X7: $i > $o,X8: $i > $o] : ( subseteq @ X8 @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',poserset) ).
thf(subseteq,axiom,
( subseteq
= ( ^ [X4: $i > $o,X5: $i > $o] :
! [X6: $i] :
( ( X4 @ X6 )
=> ( X5 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subseteq) ).
thf(seteq,axiom,
( seteq
= ( ^ [X1: ( $i > $o ) > $o,X2: ( $i > $o ) > $o] :
! [X3: $i > $o] :
( ( X1 @ X3 )
<=> ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',seteq) ).
thf(emptyset,axiom,
( emptyset
= ( ^ [X9: $i] : ~ $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyset) ).
thf(conj,conjecture,
( seteq @ ( powerset @ emptyset )
@ ^ [X10: $i > $o] : ( X10 = emptyset ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_5,plain,
( powerset
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X11: $i] :
( ( Z1 @ X11 )
=> ( Z0 @ X11 ) ) ) ),
inference(fof_simplification,[status(thm)],[poserset]) ).
thf(c_0_6,plain,
( subseteq
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X6: $i] :
( ( Z0 @ X6 )
=> ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[subseteq]) ).
thf(c_0_7,plain,
( seteq
= ( ^ [Z0: ( $i > $o ) > $o,Z1: ( $i > $o ) > $o] :
! [X3: $i > $o] :
( ( Z0 @ X3 )
<=> ( Z1 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[seteq]) ).
thf(c_0_8,plain,
( emptyset
= ( ^ [Z0: $i] : ~ $true ) ),
inference(fof_simplification,[status(thm)],[emptyset]) ).
thf(c_0_9,plain,
( powerset
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X11: $i] :
( ( Z1 @ X11 )
=> ( Z0 @ X11 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ! [X13: $i > $o] :
( ! [X12: $i] :
( ( X13 @ X12 )
=> ~ $true )
<=> ( X13
= ( ^ [Z0: $i] : ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X16: $i] :
( ( ( epred1_0 @ esk1_0 )
| ( epred1_0
!= ( ^ [Z0: $i] : ~ $true ) ) )
& ( $true
| ( epred1_0
!= ( ^ [Z0: $i] : ~ $true ) ) )
& ( ~ ( epred1_0 @ X16 )
| ~ $true
| ( epred1_0
= ( ^ [Z0: $i] : ~ $true ) ) ) ),
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_10])])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X6: $i] :
( ( epred1_0
= ( ^ [Z0: $i] : ~ $true ) )
| ~ ( epred1_0 @ X6 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0
!= ( ^ [Z0: $i] : ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X6: $i] :
( ( epred1_0
= ( ^ [Z0: $i] : ~ $true ) )
| ~ ( epred1_0 @ X6 ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( ( ^ [Z0: $i] : ~ $true )
!= epred1_0 ) ),
inference(cn,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X6: $i] :
( ( ( ^ [Z0: $i] : ~ $true )
= epred1_0 )
| ~ ( epred1_0 @ X6 ) ),
inference(cn,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X6: $i] :
~ ( epred1_0 @ X6 ),
inference(condense,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_16])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_18]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU828^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 15:24:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48 # sh5l with pid 21950 completed with status 0
% 0.20/0.48 # Result found by sh5l
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: HHUSF-FFSF00-SHHFMFNN
% 0.20/0.48 # partial match(2): HHUNF-FFSF00-SHHSMFNN
% 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 21954 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: HHUSF-FFSF00-SHHFMFNN
% 0.20/0.48 # partial match(2): HHUNF-FFSF00-SHHSMFNN
% 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 : 9
% 0.20/0.48 # Removed by relevancy pruning/SinE : 4
% 0.20/0.48 # Initial clauses : 3
% 0.20/0.48 # Removed in clause preprocessing : 1
% 0.20/0.48 # Initial clauses in saturation : 2
% 0.20/0.48 # Processed clauses : 6
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 6
% 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 : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 4
% 0.20/0.48 # ...of the previous two non-redundant : 3
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 1
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 1
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 0
% 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 : 2
% 0.20/0.48 # Positive orientable unit clauses : 0
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 1
% 0.20/0.48 # Current number of unprocessed clauses: 1
% 0.20/0.48 # ...number of literals in the above : 2
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 4
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 2
% 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 : 6
% 0.20/0.48 # Condensation successes : 1
% 0.20/0.48 # Termbank termtop insertions : 498
% 0.20/0.48 # Search garbage collected termcells : 145
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.000 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1764 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.000 s
% 0.20/0.48 # System time : 0.007 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1728 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------