TSTP Solution File: SEU648^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU648^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:28:50 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 22 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 24 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 170 ( 7 ~; 4 |; 2 &; 150 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 2 ^ 36 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
emptyset: $i ).
thf(decl_23,type,
setadjoin: $i > $i > $i ).
thf(decl_24,type,
kpair: $i > $i > $i ).
thf(decl_25,type,
setukpairinjL2: $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
esk3_0: $i ).
thf(decl_29,type,
esk4_0: $i ).
thf(setukpairinjL,conjecture,
( setukpairinjL2
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( kpair @ X1 @ X2 )
= ( kpair @ X3 @ X4 ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL) ).
thf(setukpairinjL2,axiom,
( setukpairinjL2
<=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL2) ).
thf(kpair,axiom,
( kpair
= ( ^ [X1: $i,X2: $i] : ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X13: $i,X14: $i,X15: $i,X16: $i] :
( ( ( setadjoin @ ( setadjoin @ X13 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X13 @ ( setadjoin @ X14 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X15 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X15 @ ( setadjoin @ X16 @ emptyset ) ) @ emptyset ) ) )
=> ( X13 = X15 ) )
=> ! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( ( kpair @ X1 @ X2 )
= ( kpair @ X3 @ X4 ) )
=> ( X1 = X3 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setukpairinjL]),setukpairinjL2]) ).
thf(c_0_4,plain,
! [X17: $i,X18: $i] :
( ( kpair @ X17 @ X18 )
= ( setadjoin @ ( setadjoin @ X17 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X17 @ ( setadjoin @ X18 @ emptyset ) ) @ emptyset ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[kpair])]) ).
thf(c_0_5,negated_conjecture,
! [X21: $i,X22: $i,X23: $i,X24: $i] :
( ( ( ( setadjoin @ ( setadjoin @ X21 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X21 @ ( setadjoin @ X22 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X23 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X23 @ ( setadjoin @ X24 @ emptyset ) ) @ emptyset ) ) )
| ( X21 = X23 ) )
& ( ( kpair @ esk1_0 @ esk2_0 )
= ( kpair @ esk3_0 @ esk4_0 ) )
& ( esk1_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_6,plain,
! [X19: $i,X20: $i] :
( ( kpair @ X19 @ X20 )
= ( setadjoin @ ( setadjoin @ X19 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X19 @ ( setadjoin @ X20 @ emptyset ) ) @ emptyset ) ) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X1 = X3 )
| ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: $i,X2: $i] :
( ( kpair @ X1 @ X2 )
= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X1 = X2 )
| ( ( kpair @ X1 @ X3 )
!= ( kpair @ X2 @ X4 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( kpair @ esk1_0 @ esk2_0 )
= ( kpair @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = esk3_0 )
| ( ( kpair @ X1 @ X2 )
!= ( kpair @ esk1_0 @ esk2_0 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU648^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.14 % 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 15:37:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/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.18/0.48 # Version: 3.1.0-ho
% 0.18/0.48 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho5 with 300s (1) cores
% 0.18/0.48 # Starting sh4l with 300s (1) cores
% 0.18/0.48 # Starting ho_unfolding_2 with 300s (1) cores
% 0.18/0.48 # ho_unfolding_2 with pid 31101 completed with status 0
% 0.18/0.48 # Result found by ho_unfolding_2
% 0.18/0.48 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho5 with 300s (1) cores
% 0.18/0.48 # Starting sh4l with 300s (1) cores
% 0.18/0.48 # Starting ho_unfolding_2 with 300s (1) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HHUPF-FFSF22-MSFFMFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # new_ho_10 with pid 31102 completed with status 0
% 0.18/0.48 # Result found by new_ho_10
% 0.18/0.48 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho5 with 300s (1) cores
% 0.18/0.48 # Starting sh4l with 300s (1) cores
% 0.18/0.48 # Starting ho_unfolding_2 with 300s (1) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HHUPF-FFSF22-MSFFMFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 7
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 8
% 0.18/0.48 # Removed in clause preprocessing : 4
% 0.18/0.48 # Initial clauses in saturation : 4
% 0.18/0.48 # Processed clauses : 9
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 0
% 0.18/0.48 # ...remaining for further processing : 9
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 5
% 0.18/0.48 # ...of the previous two non-redundant : 3
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 3
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 2
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 2
% 0.18/0.48 # ...of those cached : 0
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 5
% 0.18/0.48 # Positive orientable unit clauses : 2
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 1
% 0.18/0.48 # Non-unit-clauses : 2
% 0.18/0.48 # Current number of unprocessed clauses: 2
% 0.18/0.48 # ...number of literals in the above : 3
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 4
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.18/0.48 # Non-unit clause-clause subsumptions : 0
% 0.18/0.48 # Unit Clause-clause subsumption calls : 0
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 9
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 596
% 0.18/0.48 # Search garbage collected termcells : 138
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.003 s
% 0.18/0.48 # System time : 0.001 s
% 0.18/0.48 # Total time : 0.004 s
% 0.18/0.48 # Maximum resident set size: 1772 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.005 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.007 s
% 0.18/0.48 # Maximum resident set size: 1700 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------