TSTP Solution File: SET646^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET646^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 02:55:08 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 29 ( 14 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 31 ( 3 ~; 4 |; 3 &; 18 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 32 ( 22 ^ 10 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_36,type,
cartesian_product: ( $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(decl_37,type,
pair_rel: $i > $i > $i > $i > $o ).
thf(decl_39,type,
sub_rel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_57,type,
esk1_0: $i ).
thf(decl_58,type,
esk2_0: $i ).
thf(decl_59,type,
esk3_0: $i ).
thf(decl_60,type,
esk4_0: $i ).
thf(cartesian_product,axiom,
( cartesian_product
= ( ^ [X22: $i > $o,X23: $i > $o,X4: $i,X24: $i] :
( ( X22 @ X4 )
& ( X23 @ X24 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',cartesian_product) ).
thf(pair_rel,axiom,
( pair_rel
= ( ^ [X1: $i,X3: $i,X4: $i,X24: $i] :
( ( X4 = X1 )
| ( X24 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',pair_rel) ).
thf(sub_rel,axiom,
( sub_rel
= ( ^ [X26: $i > $i > $o,X27: $i > $i > $o] :
! [X1: $i,X3: $i] :
( ( X26 @ X1 @ X3 )
=> ( X27 @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',sub_rel) ).
thf(thm,conjecture,
! [X1: $i,X3: $i] :
( sub_rel @ ( pair_rel @ X1 @ X3 )
@ ( cartesian_product
@ ^ [X1: $i] : $true
@ ^ [X1: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_4,plain,
( cartesian_product
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i,Z3: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z3 ) ) ) ),
inference(fof_simplification,[status(thm)],[cartesian_product]) ).
thf(c_0_5,plain,
( pair_rel
= ( ^ [Z0: $i,Z1: $i,Z2: $i,Z3: $i] :
( ( Z2 = Z0 )
| ( Z3 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[pair_rel]) ).
thf(c_0_6,plain,
( sub_rel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X1: $i,X3: $i] :
( ( Z0 @ X1 @ X3 )
=> ( Z1 @ X1 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[sub_rel]) ).
thf(c_0_7,negated_conjecture,
~ ! [X1: $i,X3: $i,X46: $i,X47: $i] :
( ( ( X46 = X1 )
| ( X47 = X3 ) )
=> $true ),
inference(fof_simplification,[status(thm)],[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)],[thm])]),c_0_4]),c_0_5]),c_0_6])]) ).
thf(c_0_8,negated_conjecture,
( ( ( esk3_0 = esk1_0 )
| ( esk4_0 = esk2_0 ) )
& ~ $true ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_9,negated_conjecture,
~ $true,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET646^3 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n028.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 : Mon May 20 12:37:22 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.48 # Starting almost_fo_3_lam with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # ehoh_best2_full_lfho with pid 2802 completed with status 0
% 0.19/0.48 # Result found by ehoh_best2_full_lfho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHPF-FFSF00-SHSSMFNN
% 0.19/0.48 # partial match(1): HGHNF-FFSF00-SHSSMFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 2806 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.19/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGHPF-FFSF00-SHSSMFNN
% 0.19/0.49 # partial match(1): HGHNF-FFSF00-SHSSMFNN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 71
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 37
% 0.19/0.49 # Removed in clause preprocessing : 35
% 0.19/0.49 # Initial clauses in saturation : 2
% 0.19/0.49 # Processed clauses : 1
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 0
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 0
% 0.19/0.49 # ...of the previous two non-redundant : 0
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 0
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 0
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 0
% 0.19/0.49 # Positive orientable unit clauses : 0
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 1
% 0.19/0.49 # ...number of literals in the above : 2
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 0
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 1
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 1760
% 0.19/0.49 # Search garbage collected termcells : 145
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.003 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.005 s
% 0.19/0.49 # Maximum resident set size: 1896 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.009 s
% 0.19/0.49 # Maximum resident set size: 1812 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------