TSTP Solution File: SEU778^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU778^2 : TPTP v8.2.0. Released v3.7.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 03:30:10 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 28 ( 10 unt; 12 typ; 0 def)
% Number of atoms : 54 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 189 ( 3 ~; 0 |; 13 &; 165 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 57 ( 34 ^ 18 !; 5 ?; 57 :)
% 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,
breln1: $i > $i > $o ).
thf(decl_29,type,
setOfPairsIsBReln1: $o ).
thf(decl_30,type,
breln1compset: $i > $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(breln1,axiom,
( breln1
= ( ^ [X1: $i,X4: $i] : ( breln @ X1 @ X1 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).
thf(setOfPairsIsBReln1,axiom,
( setOfPairsIsBReln1
<=> ! [X1: $i,X5: $i > $i > $o] :
( breln1 @ X1
@ ( dpsetconstr @ X1 @ X1
@ ^ [X6: $i,X7: $i] : ( X5 @ X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setOfPairsIsBReln1) ).
thf(breln1compset,axiom,
( breln1compset
= ( ^ [X1: $i,X4: $i,X8: $i] :
( dpsetconstr @ X1 @ X1
@ ^ [X6: $i,X7: $i] :
? [X9: $i] :
( ( in @ X9 @ X1 )
& ( in @ ( kpair @ X6 @ X9 ) @ X4 )
& ( in @ ( kpair @ X9 @ X7 ) @ X8 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compset) ).
thf(breln1compprop,conjecture,
( setOfPairsIsBReln1
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X8: $i] :
( ( breln1 @ X1 @ X8 )
=> ( breln1 @ X1 @ ( breln1compset @ X1 @ X4 @ X8 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compprop) ).
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,
( setOfPairsIsBReln1
<=> ! [X1: $i,X5: $i > $i > $o] :
( breln1 @ X1
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( X5 @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[setOfPairsIsBReln1]) ).
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,plain,
( breln1compset
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( dpsetconstr @ Z0 @ Z0
@ ^ [Z3: $i,Z4: $i] :
? [X9: $i] :
( ( in @ X9 @ Z0 )
& ( in @ ( kpair @ Z3 @ X9 ) @ Z1 )
& ( in @ ( kpair @ X9 @ Z4 ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1compset]) ).
thf(c_0_10,plain,
( setOfPairsIsBReln1
= ( ! [X1: $i,X5: $i > $i > $o] :
( subset
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] : ( X5 @ Z0 @ Z1 ) )
@ ( cartprod @ X1 @ X1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( ! [X15: $i,X16: $i > $i > $o] : ( subset @ ( dpsetconstr @ X15 @ X15 @ X16 ) @ ( cartprod @ X15 @ X15 ) )
=> ! [X1: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X1 ) )
=> ! [X8: $i] :
( ( subset @ X8 @ ( cartprod @ X1 @ X1 ) )
=> ( subset
@ ( dpsetconstr @ X1 @ X1
@ ^ [Z0: $i,Z1: $i] :
? [X17: $i] :
( ( in @ X17 @ X1 )
& ( in @ ( kpair @ Z0 @ X17 ) @ X4 )
& ( in @ ( kpair @ X17 @ Z1 ) @ X8 ) ) )
@ ( cartprod @ X1 @ X1 ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1compprop]),c_0_8]),c_0_9]),c_0_10])]) ).
thf(c_0_12,negated_conjecture,
! [X18: $i,X19: $i > $i > $o] :
( ( subset @ ( dpsetconstr @ X18 @ X18 @ X19 ) @ ( cartprod @ X18 @ X18 ) )
& ( subset @ esk2_0 @ ( cartprod @ esk1_0 @ esk1_0 ) )
& ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk1_0 ) )
& ~ ( subset
@ ( dpsetconstr @ esk1_0 @ esk1_0
@ ^ [Z0: $i,Z1: $i] :
? [X17: $i] :
( ( in @ X17 @ esk1_0 )
& ( in @ ( kpair @ Z0 @ X17 ) @ esk2_0 )
& ( in @ ( kpair @ X17 @ Z1 ) @ esk3_0 ) ) )
@ ( cartprod @ esk1_0 @ esk1_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_11])])])])]) ).
thf(c_0_13,negated_conjecture,
~ ( subset
@ ( dpsetconstr @ esk1_0 @ esk1_0
@ ^ [Z0: $i,Z1: $i] :
? [X23: $i] :
( ( in @ X23 @ esk1_0 )
& ( in @ ( kpair @ Z0 @ X23 ) @ esk2_0 )
& ( in @ ( kpair @ X23 @ Z1 ) @ esk3_0 ) ) )
@ ( cartprod @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X5: $i > $i > $o,X1: $i] : ( subset @ ( dpsetconstr @ X1 @ X1 @ X5 ) @ ( cartprod @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU778^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:06:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSLMNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.48 # sh5l with pid 24370 completed with status 0
% 0.19/0.48 # Result found by sh5l
% 0.19/0.48 # Preprocessing class: HSSSSMSSSLMNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: HUUNF-FFSF32-DSFFMFBN
% 0.19/0.48 # partial match(4): HGUNF-FFSF32-SFFFMFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.48 # new_ho_10 with pid 24373 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSLMNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: HUUNF-FFSF32-DSFFMFBN
% 0.19/0.48 # partial match(4): HGUNF-FFSF32-SFFFMFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 14
% 0.19/0.48 # Removed by relevancy pruning/SinE : 9
% 0.19/0.48 # Initial clauses : 4
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 4
% 0.19/0.48 # Processed clauses : 8
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 8
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 1
% 0.19/0.48 # ...of the previous two non-redundant : 0
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 1
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 4
% 0.19/0.48 # Positive orientable unit clauses : 3
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 4
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 8
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 641
% 0.19/0.48 # Search garbage collected termcells : 196
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.000 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1756 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1732 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------