TSTP Solution File: SEU735^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU735^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:29:40 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 40 ( 0 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 190 ( 11 ~; 8 |; 4 &; 151 @)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 ^ 29 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
powersetI1: $o ).
thf(decl_26,type,
binintersect: $i > $i > $i ).
thf(decl_27,type,
setminus: $i > $i > $i ).
thf(decl_28,type,
complementSubsetComplementIntersect: $o ).
thf(decl_29,type,
esk1_0: $i ).
thf(decl_30,type,
esk2_0: $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(complementInPowersetComplementIntersect,conjecture,
( powersetI1
=> ( complementSubsetComplementIntersect
=> ! [X1: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ X3 ) @ ( powerset @ ( setminus @ X1 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complementInPowersetComplementIntersect) ).
thf(powersetI1,axiom,
( powersetI1
<=> ! [X1: $i,X2: $i] :
( ( subset @ X2 @ X1 )
=> ( in @ X2 @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI1) ).
thf(complementSubsetComplementIntersect,axiom,
( complementSubsetComplementIntersect
<=> ! [X1: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( subset @ ( setminus @ X1 @ X3 ) @ ( setminus @ X1 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complementSubsetComplementIntersect) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X13: $i,X14: $i] :
( ( subset @ X14 @ X13 )
=> ( in @ X14 @ ( powerset @ X13 ) ) )
=> ( ! [X15: $i,X16: $i] :
( ( in @ X16 @ ( powerset @ X15 ) )
=> ! [X17: $i] :
( ( in @ X17 @ ( powerset @ X15 ) )
=> ( subset @ ( setminus @ X15 @ X16 ) @ ( setminus @ X15 @ ( binintersect @ X16 @ X17 ) ) ) ) )
=> ! [X1: $i,X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X1 @ X3 ) @ ( powerset @ ( setminus @ X1 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[complementInPowersetComplementIntersect]),powersetI1]),complementSubsetComplementIntersect]) ).
thf(c_0_4,negated_conjecture,
! [X18: $i,X19: $i,X20: $i,X21: $i,X22: $i] :
( ( ~ ( subset @ X19 @ X18 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ( ~ ( in @ X21 @ ( powerset @ X20 ) )
| ~ ( in @ X22 @ ( powerset @ X20 ) )
| ( subset @ ( setminus @ X20 @ X21 ) @ ( setminus @ X20 @ ( binintersect @ X21 @ X22 ) ) ) )
& ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
& ~ ( in @ ( setminus @ esk1_0 @ esk2_0 ) @ ( powerset @ ( setminus @ esk1_0 @ ( binintersect @ esk2_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 @ ( powerset @ X2 ) )
| ~ ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ ( setminus @ X2 @ X1 ) @ ( setminus @ X2 @ ( binintersect @ X1 @ X3 ) ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( in @ ( setminus @ esk1_0 @ esk2_0 ) @ ( powerset @ ( setminus @ esk1_0 @ ( binintersect @ esk2_0 @ esk3_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( setminus @ X1 @ X2 ) @ ( powerset @ ( setminus @ X1 @ ( binintersect @ X2 @ X3 ) ) ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
in @ esk2_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU735^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n023.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 : Sun May 19 16:30:08 EDT 2024
% 0.12/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: HSSSSLSSSLSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.48 # post_as_ho3 with pid 7838 completed with status 0
% 0.19/0.48 # Result found by post_as_ho3
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUNF-FFSF21-MFFFMFNN
% 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 7841 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUNF-FFSF21-MFFFMFNN
% 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 # 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 : 10
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 12
% 0.19/0.48 # Removed in clause preprocessing : 7
% 0.19/0.48 # Initial clauses in saturation : 5
% 0.19/0.48 # Processed clauses : 11
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 11
% 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 : 2
% 0.19/0.48 # ...of the previous two non-redundant : 1
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 2
% 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 : 2
% 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 : 6
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 3
% 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 : 5
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 10
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 10
% 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 : 11
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 770
% 0.19/0.48 # Search garbage collected termcells : 209
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.002 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.004 s
% 0.19/0.48 # Maximum resident set size: 1736 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.002 s
% 0.19/0.48 # System time : 0.006 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1700 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------