TSTP Solution File: SEU647^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU647^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:49 EDT 2024
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 20 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 26 ( 12 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 186 ( 5 ~; 2 |; 3 &; 166 @)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
setadjoinIL: $o ).
thf(decl_26,type,
setukpairinjL1: $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(setukpairinjL2,conjecture,
( setadjoinIL
=> ( setukpairinjL1
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL2) ).
thf(setukpairinjL1,axiom,
( setukpairinjL1
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X14: $i,X15: $i] : ( in @ X14 @ ( setadjoin @ X14 @ X15 ) )
=> ( ! [X16: $i,X17: $i,X18: $i] :
( ( in @ ( setadjoin @ X18 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X16 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X16 @ ( setadjoin @ X17 @ emptyset ) ) @ emptyset ) ) )
=> ( X16 = X18 ) )
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setukpairinjL2]),setukpairinjL1]),setadjoinIL]) ).
thf(c_0_4,negated_conjecture,
! [X19: $i,X20: $i,X21: $i,X22: $i,X23: $i] :
( ( in @ X19 @ ( setadjoin @ X19 @ X20 ) )
& ( ~ ( in @ ( setadjoin @ X23 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X21 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X21 @ ( setadjoin @ X22 @ emptyset ) ) @ emptyset ) ) )
| ( X21 = X23 ) )
& ( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) ) @ emptyset ) ) )
& ( esk1_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,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) ) @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X2 = X1 )
| ~ ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
in @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) ) @ emptyset ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SEU647^2 : TPTP v8.2.0. Released v3.7.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 18:20:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.41 Running higher-order theorem proving
% 0.16/0.41 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.16/0.42 # Version: 3.1.0-ho
% 0.16/0.42 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.42 # Starting post_as_ho3 with 300s (1) cores
% 0.16/0.42 # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.42 # post_as_ho8 with pid 18156 completed with status 0
% 0.16/0.42 # Result found by post_as_ho8
% 0.16/0.42 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.16/0.42 # Search class: HHUSF-FFSF22-MFFFMFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.42 # new_ho_10 with pid 18159 completed with status 0
% 0.16/0.42 # Result found by new_ho_10
% 0.16/0.42 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.42 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.16/0.42 # Search class: HHUSF-FFSF22-MFFFMFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 8
% 0.16/0.42 # Removed by relevancy pruning/SinE : 5
% 0.16/0.42 # Initial clauses : 4
% 0.16/0.42 # Removed in clause preprocessing : 0
% 0.16/0.42 # Initial clauses in saturation : 4
% 0.16/0.42 # Processed clauses : 9
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 9
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 0
% 0.16/0.42 # Generated clauses : 4
% 0.16/0.42 # ...of the previous two non-redundant : 3
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 4
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 0
% 0.16/0.42 # ...of those cached : 0
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 5
% 0.16/0.42 # Positive orientable unit clauses : 3
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 1
% 0.16/0.42 # Current number of unprocessed clauses: 2
% 0.16/0.42 # ...number of literals in the above : 4
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 4
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 0
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 0
% 0.16/0.42 # BW rewrite match successes : 0
% 0.16/0.42 # Condensation attempts : 9
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 643
% 0.16/0.42 # Search garbage collected termcells : 169
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.003 s
% 0.16/0.42 # System time : 0.001 s
% 0.16/0.42 # Total time : 0.004 s
% 0.16/0.42 # Maximum resident set size: 1772 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.003 s
% 0.16/0.42 # System time : 0.003 s
% 0.16/0.42 # Total time : 0.006 s
% 0.16/0.42 # Maximum resident set size: 1696 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.42 % E exiting
%------------------------------------------------------------------------------