TSTP Solution File: SEU613^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU613^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:34 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 58 ( 4 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 224 ( 27 ~; 17 |; 4 &; 157 @)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 12 ^ 44 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_24,type,
dsetconstrI: $o ).
thf(decl_25,type,
binunion: $i > $i > $i ).
thf(decl_26,type,
binunionIR: $o ).
thf(decl_27,type,
symdiff: $i > $i > $i ).
thf(decl_28,type,
esk1_0: $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(symdiffI2,conjecture,
( dsetconstrI
=> ( binunionIR
=> ! [X1: $i,X5: $i,X3: $i] :
( ~ ( in @ X3 @ X1 )
=> ( ( in @ X3 @ X5 )
=> ( in @ X3 @ ( symdiff @ X1 @ X5 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffI2) ).
thf(binunionIR,axiom,
( binunionIR
<=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X5 )
=> ( in @ X3 @ ( binunion @ X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIR) ).
thf(symdiff,axiom,
( symdiff
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ ( binunion @ X1 @ X5 )
@ ^ [X3: $i] :
( ~ ( in @ X3 @ X1 )
| ~ ( in @ X3 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiff) ).
thf(c_0_4,plain,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X15: $i,X16: $i > $o,X17: $i] :
( ( in @ X17 @ X15 )
=> ( ( X16 @ X17 )
=> ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) ) ) )
=> ( ! [X18: $i,X19: $i,X20: $i] :
( ( in @ X20 @ X19 )
=> ( in @ X20 @ ( binunion @ X18 @ X19 ) ) )
=> ! [X1: $i,X5: $i,X3: $i] :
( ~ ( in @ X3 @ X1 )
=> ( ( in @ X3 @ X5 )
=> ( in @ X3 @ ( symdiff @ X1 @ X5 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[symdiffI2]),c_0_4]),binunionIR])])]) ).
thf(c_0_6,plain,
( symdiff
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( binunion @ Z0 @ Z1 )
@ ^ [Z2: $i] :
( ~ ( in @ Z2 @ Z0 )
| ~ ( in @ Z2 @ Z1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[symdiff]) ).
thf(c_0_7,negated_conjecture,
! [X21: $i,X22: $i > $o,X23: $i,X24: $i,X25: $i,X26: $i] :
( ( ~ ( in @ X23 @ X21 )
| ~ ( X22 @ X23 )
| ( in @ X23 @ ( dsetconstr @ X21 @ X22 ) ) )
& ( ~ ( in @ X26 @ X25 )
| ( in @ X26 @ ( binunion @ X24 @ X25 ) ) )
& ~ ( in @ esk3_0 @ esk1_0 )
& ( in @ esk3_0 @ esk2_0 )
& ~ ( in @ esk3_0 @ ( symdiff @ esk1_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_5])])])])]) ).
thf(c_0_8,plain,
( symdiff
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( binunion @ Z0 @ Z1 )
@ ^ [Z2: $i] :
( ~ ( in @ Z2 @ Z0 )
| ~ ( in @ Z2 @ Z1 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ ( binunion @ X1 @ X3 )
@ ^ [Z0: $i] :
( ~ ( in @ Z0 @ X1 )
| ~ ( in @ Z0 @ X3 ) ) )
= ( symdiff @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ( in @ X1 @ ( symdiff @ X3 @ X4 ) )
| ~ ( ~ ( in @ X1 @ X3 )
| ~ ( in @ X1 @ X4 ) )
| ~ ( in @ X1 @ ( binunion @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ( in @ X1 @ ( symdiff @ X3 @ X4 ) )
| ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( binunion @ X3 @ X4 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1 @ ( binunion @ X4 @ X3 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ esk3_0 @ ( symdiff @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ( in @ X1 @ ( symdiff @ X3 @ X4 ) )
| ( in @ X1 @ X3 )
| ~ ( in @ X1 @ X4 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_17,negated_conjecture,
~ ( in @ esk3_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU613^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.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:20:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting full_lambda_3 with 300s (1) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # Starting sh4l with 300s (1) cores
% 0.21/0.50 # ho_unfolding_6 with pid 23582 completed with status 0
% 0.21/0.50 # Result found by ho_unfolding_6
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting full_lambda_3 with 300s (1) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HHUSF-FFSF22-DSFFMSBN
% 0.21/0.50 # partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # new_ho_10 with pid 23585 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting full_lambda_3 with 300s (1) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HHUSF-FFSF22-DSFFMSBN
% 0.21/0.50 # partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 10
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 12
% 0.21/0.50 # Removed in clause preprocessing : 6
% 0.21/0.50 # Initial clauses in saturation : 6
% 0.21/0.50 # Processed clauses : 18
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 18
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 9
% 0.21/0.50 # ...of the previous two non-redundant : 6
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 4
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 2
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 11
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 5
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 7
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 9
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 7
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 18
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1112
% 0.21/0.50 # Search garbage collected termcells : 237
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.004 s
% 0.21/0.50 # Maximum resident set size: 1732 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1704 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------