TSTP Solution File: SEU659^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU659^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:55 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 3 unt; 11 typ; 0 def)
% Number of atoms : 43 ( 13 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 180 ( 12 ~; 9 |; 9 &; 138 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 51 ( 0 ^ 47 !; 4 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
kpair: $i > $i > $i ).
thf(decl_24,type,
cartprod: $i > $i > $i ).
thf(decl_25,type,
cartprodmempair1: $o ).
thf(decl_26,type,
setukpairinjL: $o ).
thf(decl_27,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_28,type,
esk2_3: $i > $i > $i > $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,
esk6_0: $i ).
thf(cartprodpairmemEL,conjecture,
( cartprodmempair1
=> ( setukpairinjL
=> ! [X1: $i,X2: $i,X4: $i,X5: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( cartprod @ X1 @ X2 ) )
=> ( in @ X4 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodpairmemEL) ).
thf(cartprodmempair1,axiom,
( cartprodmempair1
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( cartprod @ X1 @ X2 ) )
=> ? [X4: $i] :
( ( in @ X4 @ X1 )
& ? [X5: $i] :
( ( in @ X5 @ X2 )
& ( X3
= ( kpair @ X4 @ X5 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodmempair1) ).
thf(setukpairinjL,axiom,
( setukpairinjL
<=> ! [X4: $i,X5: $i,X6: $i,X3: $i] :
( ( ( kpair @ X4 @ X5 )
= ( kpair @ X6 @ X3 ) )
=> ( X4 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X20: $i,X21: $i,X22: $i] :
( ( in @ X22 @ ( cartprod @ X20 @ X21 ) )
=> ? [X23: $i] :
( ( in @ X23 @ X20 )
& ? [X24: $i] :
( ( in @ X24 @ X21 )
& ( X22
= ( kpair @ X23 @ X24 ) ) ) ) )
=> ( ! [X25: $i,X26: $i,X27: $i,X28: $i] :
( ( ( kpair @ X25 @ X26 )
= ( kpair @ X27 @ X28 ) )
=> ( X25 = X27 ) )
=> ! [X1: $i,X2: $i,X4: $i,X5: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( cartprod @ X1 @ X2 ) )
=> ( in @ X4 @ X1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cartprodpairmemEL]),cartprodmempair1]),setukpairinjL]) ).
thf(c_0_4,negated_conjecture,
! [X29: $i,X30: $i,X31: $i,X34: $i,X35: $i,X36: $i,X37: $i] :
( ( ( in @ ( esk1_3 @ X29 @ X30 @ X31 ) @ X29 )
| ~ ( in @ X31 @ ( cartprod @ X29 @ X30 ) ) )
& ( ( in @ ( esk2_3 @ X29 @ X30 @ X31 ) @ X30 )
| ~ ( in @ X31 @ ( cartprod @ X29 @ X30 ) ) )
& ( ( X31
= ( kpair @ ( esk1_3 @ X29 @ X30 @ X31 ) @ ( esk2_3 @ X29 @ X30 @ X31 ) ) )
| ~ ( in @ X31 @ ( cartprod @ X29 @ X30 ) ) )
& ( ( ( kpair @ X34 @ X35 )
!= ( kpair @ X36 @ X37 ) )
| ( X34 = X36 ) )
& ( in @ ( kpair @ esk5_0 @ esk6_0 ) @ ( cartprod @ esk3_0 @ esk4_0 ) )
& ~ ( in @ esk5_0 @ esk3_0 ) ),
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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X1 = X3 )
| ( ( kpair @ X1 @ X2 )
!= ( kpair @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1
= ( kpair @ ( esk1_3 @ X2 @ X3 @ X1 ) @ ( esk2_3 @ X2 @ X3 @ X1 ) ) )
| ~ ( in @ X1 @ ( cartprod @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ~ ( in @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( ( esk1_3 @ X1 @ X2 @ ( kpair @ X3 @ X4 ) )
= X3 )
| ~ ( in @ ( kpair @ X3 @ X4 ) @ ( cartprod @ X1 @ X2 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ ( kpair @ X1 @ X3 ) @ ( cartprod @ X2 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
in @ ( kpair @ esk5_0 @ esk6_0 ) @ ( cartprod @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
~ ( in @ esk5_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SEU659^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 16:40:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running higher-order theorem proving
% 0.20/0.50 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.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.51 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.51 # post_as_ho2 with pid 29360 completed with status 0
% 0.20/0.51 # Result found by post_as_ho2
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.51 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HHUSF-FFSF32-SFFFMFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # new_ho_10 with pid 29364 completed with status 0
% 0.20/0.51 # Result found by new_ho_10
% 0.20/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.51 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HHUSF-FFSF32-SFFFMFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 8
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 11
% 0.20/0.51 # Removed in clause preprocessing : 5
% 0.20/0.51 # Initial clauses in saturation : 6
% 0.20/0.51 # Processed clauses : 14
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 14
% 0.20/0.51 # Other redundant clauses eliminated : 2
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 10
% 0.20/0.51 # ...of the previous two non-redundant : 6
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 7
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 3
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 8
% 0.20/0.51 # Positive orientable unit clauses : 1
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 6
% 0.20/0.51 # Current number of unprocessed clauses: 3
% 0.20/0.51 # ...number of literals in the above : 7
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 6
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 14
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 800
% 0.20/0.51 # Search garbage collected termcells : 250
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.004 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.004 s
% 0.20/0.51 # Maximum resident set size: 1708 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------