TSTP Solution File: SEU777^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU777^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:30:09 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 32 ( 13 unt; 13 typ; 0 def)
% Number of atoms : 51 ( 9 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 199 ( 6 ~; 3 |; 5 &; 170 @)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 69 ( 30 ^ 39 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
subset: $i > $i > $o ).
thf(decl_24,type,
kpair: $i > $i > $i ).
thf(decl_25,type,
cartprod: $i > $i > $i ).
thf(decl_26,type,
breln: $i > $i > $i > $o ).
thf(decl_27,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_28,type,
dpsetconstrER: $o ).
thf(decl_29,type,
breln1: $i > $i > $o ).
thf(decl_30,type,
breln1invset: $i > $i > $i ).
thf(decl_31,type,
esk1_0: $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(breln1,axiom,
( breln1
= ( ^ [X1: $i,X9: $i] : ( breln @ X1 @ X1 @ X9 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(dpsetconstrER,axiom,
( dpsetconstrER
<=> ! [X1: $i,X2: $i,X4: $i > $i > $o,X5: $i,X6: $i] :
( ( in @ ( kpair @ X5 @ X6 )
@ ( dpsetconstr @ X1 @ X2
@ ^ [X7: $i,X8: $i] : ( X4 @ X7 @ X8 ) ) )
=> ( X4 @ X5 @ X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrER) ).
thf(breln1invE,conjecture,
( dpsetconstrER
=> ! [X1: $i,X9: $i] :
( ( breln1 @ X1 @ X9 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X5 ) @ ( breln1invset @ X1 @ X9 ) )
=> ( in @ ( kpair @ X5 @ X6 ) @ X9 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invE) ).
thf(breln1invset,axiom,
( breln1invset
= ( ^ [X1: $i,X9: $i] :
( dpsetconstr @ X1 @ X1
@ ^ [X5: $i,X6: $i] : ( in @ ( kpair @ X6 @ X5 ) @ X9 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invset) ).
thf(c_0_5,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1]) ).
thf(c_0_6,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_7,plain,
( dpsetconstrER
<=> ! [X1: $i,X2: $i,X4: $i > $i > $o,X5: $i,X6: $i] :
( ( in @ ( kpair @ X5 @ X6 )
@ ( dpsetconstr @ X1 @ X2
@ ^ [Z0: $i,Z1: $i] : ( X4 @ Z0 @ Z1 ) ) )
=> ( X4 @ X5 @ X6 ) ) ),
inference(fof_simplification,[status(thm)],[dpsetconstrER]) ).
thf(c_0_8,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( ! [X19: $i,X20: $i,X21: $i > $i > $o,X22: $i,X23: $i] :
( ( in @ ( kpair @ X22 @ X23 ) @ ( dpsetconstr @ X19 @ X20 @ X21 ) )
=> ( X21 @ X22 @ X23 ) )
=> ! [X1: $i,X9: $i] :
( ( subset @ X9 @ ( cartprod @ X1 @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X5 ) @ ( breln1invset @ X1 @ X9 ) )
=> ( in @ ( kpair @ X5 @ X6 ) @ X9 ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1invE]),c_0_7]),c_0_8])]) ).
thf(c_0_10,plain,
( breln1invset
= ( ^ [Z0: $i,Z1: $i] :
( dpsetconstr @ Z0 @ Z0
@ ^ [Z2: $i,Z3: $i] : ( in @ ( kpair @ Z3 @ Z2 ) @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1invset]) ).
thf(c_0_11,negated_conjecture,
! [X24: $i,X25: $i,X26: $i > $i > $o,X27: $i,X28: $i] :
( ( ~ ( in @ ( kpair @ X27 @ X28 ) @ ( dpsetconstr @ X24 @ X25 @ X26 ) )
| ( X26 @ X27 @ X28 ) )
& ( subset @ esk2_0 @ ( cartprod @ esk1_0 @ esk1_0 ) )
& ( in @ esk3_0 @ esk1_0 )
& ( in @ esk4_0 @ esk1_0 )
& ( in @ ( kpair @ esk4_0 @ esk3_0 ) @ ( breln1invset @ esk1_0 @ esk2_0 ) )
& ~ ( in @ ( kpair @ esk3_0 @ esk4_0 ) @ esk2_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_9])])])])]) ).
thf(c_0_12,plain,
( breln1invset
= ( ^ [Z0: $i,Z1: $i] :
( dpsetconstr @ Z0 @ Z0
@ ^ [Z2: $i,Z3: $i] : ( in @ ( kpair @ Z3 @ Z2 ) @ Z1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X5: $i,X4: $i > $i > $o] :
( ( X4 @ X1 @ X2 )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ ( dpsetconstr @ X3 @ X5 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X1: $i,X2: $i] :
( ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( in @ ( kpair @ Z1 @ Z0 ) @ X2 ) )
= ( breln1invset @ X1 @ X2 ) ),
inference(arg_cong,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ X3 )
| ~ ( in @ ( kpair @ X2 @ X1 ) @ ( breln1invset @ X5 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_16,negated_conjecture,
in @ ( kpair @ esk4_0 @ esk3_0 ) @ ( breln1invset @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
~ ( in @ ( kpair @ esk3_0 @ esk4_0 ) @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU777^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 17:00:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # Starting sh4l with 300s (1) cores
% 0.19/0.47 # Starting lpo8_s with 300s (1) cores
% 0.19/0.47 # ho_unfolding_6 with pid 5167 completed with status 0
% 0.19/0.47 # Result found by ho_unfolding_6
% 0.19/0.47 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUSF-FFSS32-DSFFMSBN
% 0.19/0.47 # partial match(1): HHUSF-FFSS32-SSFFMSBN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # new_ho_10 with pid 5170 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HHUSF-FFSS32-DSFFMSBN
% 0.19/0.47 # partial match(1): HHUSF-FFSS32-SSFFMSBN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 14
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 16
% 0.19/0.47 # Removed in clause preprocessing : 9
% 0.19/0.47 # Initial clauses in saturation : 7
% 0.19/0.47 # Processed clauses : 17
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 17
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 5
% 0.19/0.47 # ...of the previous two non-redundant : 3
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 2
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 1
% 0.19/0.47 # ...of those cached : 0
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 10
% 0.19/0.47 # Positive orientable unit clauses : 7
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 2
% 0.19/0.47 # Current number of unprocessed clauses: 0
% 0.19/0.47 # ...number of literals in the above : 0
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 7
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 1
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 1
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 3
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 17
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 865
% 0.19/0.47 # Search garbage collected termcells : 231
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.002 s
% 0.19/0.47 # System time : 0.004 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1724 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.002 s
% 0.19/0.47 # System time : 0.006 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1736 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------