TSTP Solution File: SWW350+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW350+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Mon Jun 24 18:11:43 EDT 2024
% Result : Theorem 2.31s 1.72s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 41 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 15 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_com__det,axiom,
! [X4,X5,X6,X7] :
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(X7),X6),X5))
=> ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(X7),X6),X4))
=> X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.nhkVqeqp3u/E---3.1_27625.p',fact_com__det) ).
fof(conj_1,hypothesis,
! [X333] :
( ! [X30] :
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),X30))
=> X333 = X30 )
=> X333 = v_s_H ),
file('/export/starexec/sandbox/tmp/tmp.nhkVqeqp3u/E---3.1_27625.p',conj_1) ).
fof(conj_3,conjecture,
hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
file('/export/starexec/sandbox/tmp/tmp.nhkVqeqp3u/E---3.1_27625.p',conj_3) ).
fof(fact_com_Osimps_I18_J,axiom,
! [X69] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X69),
file('/export/starexec/sandbox/tmp/tmp.nhkVqeqp3u/E---3.1_27625.p',fact_com_Osimps_I18_J) ).
fof(c_0_4,plain,
! [X346,X347,X348,X349] :
( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X349),X348),X347))
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X349),X348),X346))
| X346 = X347 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_com__det])])]) ).
fof(c_0_5,hypothesis,
! [X334] :
( ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),esk1_1(X334)))
| X334 = v_s_H )
& ( X334 != esk1_1(X334)
| X334 = v_s_H ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])])]) ).
cnf(c_0_6,plain,
( X4 = X3
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X1),X2),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),esk1_1(X1)))
| X1 = v_s_H ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( X1 = esk1_1(X2)
| X2 = v_s_H
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
( X1 = v_s_H
| X1 != esk1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
( esk1_1(X1) = esk1_1(X2)
| X1 = v_s_H
| X2 = v_s_H ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
fof(c_0_11,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])]) ).
fof(c_0_12,plain,
! [X69] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X69),
inference(fof_simplification,[status(thm)],[fact_com_Osimps_I18_J]) ).
cnf(c_0_13,hypothesis,
( X1 = v_s_H
| X2 = v_s_H
| esk1_1(X1) != X2 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X468] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X468),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_16,hypothesis,
( esk1_1(X1) = v_s_H
| X1 = v_s_H ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,hypothesis,
X1 = v_s_H,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWW350+1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.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 : Wed Jun 19 06:00:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 1.09/1.28 Running first-order theorem proving
% 1.09/1.28 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nhkVqeqp3u/E---3.1_27625.p
% 2.31/1.72 # Version: 3.2.0
% 2.31/1.72 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.31/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/1.72 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.31/1.72 # Starting new_bool_3 with 300s (1) cores
% 2.31/1.72 # Starting new_bool_1 with 300s (1) cores
% 2.31/1.72 # Starting sh5l with 300s (1) cores
% 2.31/1.72 # new_bool_1 with pid 27706 completed with status 0
% 2.31/1.72 # Result found by new_bool_1
% 2.31/1.72 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.31/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/1.72 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.31/1.72 # Starting new_bool_3 with 300s (1) cores
% 2.31/1.72 # Starting new_bool_1 with 300s (1) cores
% 2.31/1.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.31/1.72 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.31/1.72 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.31/1.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.31/1.72 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 27708 completed with status 0
% 2.31/1.72 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 2.31/1.72 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.31/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/1.72 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.31/1.72 # Starting new_bool_3 with 300s (1) cores
% 2.31/1.72 # Starting new_bool_1 with 300s (1) cores
% 2.31/1.72 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.31/1.72 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.31/1.72 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.31/1.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.31/1.72 # Preprocessing time : 0.014 s
% 2.31/1.72
% 2.31/1.72 # Proof found!
% 2.31/1.72 # SZS status Theorem
% 2.31/1.72 # SZS output start CNFRefutation
% See solution above
% 2.31/1.72 # Parsed axioms : 5229
% 2.31/1.72 # Removed by relevancy pruning/SinE : 4785
% 2.31/1.72 # Initial clauses : 678
% 2.31/1.72 # Removed in clause preprocessing : 29
% 2.31/1.72 # Initial clauses in saturation : 649
% 2.31/1.72 # Processed clauses : 957
% 2.31/1.72 # ...of these trivial : 56
% 2.31/1.72 # ...subsumed : 319
% 2.31/1.72 # ...remaining for further processing : 582
% 2.31/1.72 # Other redundant clauses eliminated : 135
% 2.31/1.72 # Clauses deleted for lack of memory : 0
% 2.31/1.72 # Backward-subsumed : 10
% 2.31/1.72 # Backward-rewritten : 544
% 2.31/1.72 # Generated clauses : 9083
% 2.31/1.72 # ...of the previous two non-redundant : 8365
% 2.31/1.72 # ...aggressively subsumed : 0
% 2.31/1.72 # Contextual simplify-reflections : 5
% 2.31/1.72 # Paramodulations : 8894
% 2.31/1.72 # Factorizations : 6
% 2.31/1.72 # NegExts : 0
% 2.31/1.72 # Equation resolutions : 184
% 2.31/1.72 # Disequality decompositions : 0
% 2.31/1.72 # Total rewrite steps : 2434
% 2.31/1.72 # ...of those cached : 1061
% 2.31/1.72 # Propositional unsat checks : 0
% 2.31/1.72 # Propositional check models : 0
% 2.31/1.72 # Propositional check unsatisfiable : 0
% 2.31/1.72 # Propositional clauses : 0
% 2.31/1.72 # Propositional clauses after purity: 0
% 2.31/1.72 # Propositional unsat core size : 0
% 2.31/1.72 # Propositional preprocessing time : 0.000
% 2.31/1.72 # Propositional encoding time : 0.000
% 2.31/1.72 # Propositional solver time : 0.000
% 2.31/1.72 # Success case prop preproc time : 0.000
% 2.31/1.72 # Success case prop encoding time : 0.000
% 2.31/1.72 # Success case prop solver time : 0.000
% 2.31/1.72 # Current number of processed clauses : 5
% 2.31/1.72 # Positive orientable unit clauses : 3
% 2.31/1.72 # Positive unorientable unit clauses: 1
% 2.31/1.72 # Negative unit clauses : 0
% 2.31/1.72 # Non-unit-clauses : 1
% 2.31/1.72 # Current number of unprocessed clauses: 7950
% 2.31/1.72 # ...number of literals in the above : 26130
% 2.31/1.72 # Current number of archived formulas : 0
% 2.31/1.72 # Current number of archived clauses : 554
% 2.31/1.72 # Clause-clause subsumption calls (NU) : 34208
% 2.31/1.72 # Rec. Clause-clause subsumption calls : 25378
% 2.31/1.72 # Non-unit clause-clause subsumptions : 191
% 2.31/1.72 # Unit Clause-clause subsumption calls : 1772
% 2.31/1.72 # Rewrite failures with RHS unbound : 27
% 2.31/1.72 # BW rewrite match attempts : 2606
% 2.31/1.72 # BW rewrite match successes : 911
% 2.31/1.72 # Condensation attempts : 0
% 2.31/1.72 # Condensation successes : 0
% 2.31/1.72 # Termbank termtop insertions : 455978
% 2.31/1.72 # Search garbage collected termcells : 55316
% 2.31/1.72
% 2.31/1.72 # -------------------------------------------------
% 2.31/1.72 # User time : 0.269 s
% 2.31/1.72 # System time : 0.022 s
% 2.31/1.72 # Total time : 0.291 s
% 2.31/1.72 # Maximum resident set size: 11252 pages
% 2.31/1.72
% 2.31/1.72 # -------------------------------------------------
% 2.31/1.72 # User time : 0.394 s
% 2.31/1.72 # System time : 0.028 s
% 2.31/1.72 # Total time : 0.422 s
% 2.31/1.72 # Maximum resident set size: 9600 pages
% 2.31/1.72 % E---3.1 exiting
% 2.31/1.72 % E exiting
%------------------------------------------------------------------------------