TSTP Solution File: SWW348+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW348+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:42 EDT 2024
% Result : Theorem 2.14s 1.75s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 44 ( 28 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 40 ( 15 ~; 15 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 35 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X106,X107] :
( ! [X333] :
( ! [X30] :
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X30))
=> X333 = X30 )
=> X333 = X107 )
=> hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X107)) ),
file('/export/starexec/sandbox2/tmp/tmp.4qf9HdjUaR/E---3.1_30437.p',conj_1) ).
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/sandbox2/tmp/tmp.4qf9HdjUaR/E---3.1_30437.p',fact_com__det) ).
fof(fact_com_Osimps_I18_J,axiom,
! [X69] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X69),
file('/export/starexec/sandbox2/tmp/tmp.4qf9HdjUaR/E---3.1_30437.p',fact_com_Osimps_I18_J) ).
fof(c_0_3,negated_conjecture,
~ ! [X106,X107] :
( ! [X333] :
( ! [X30] :
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X30))
=> X333 = X30 )
=> X333 = X107 )
=> hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X107)) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_4,plain,
! [X347,X348,X349,X350] :
( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X350),X349),X348))
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X350),X349),X347))
| X347 = X348 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_com__det])])]) ).
fof(c_0_5,negated_conjecture,
! [X336] :
( ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk3_1(X336)))
| X336 = esk2_0 )
& ( X336 != esk3_1(X336)
| X336 = esk2_0 )
& ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk2_0)) ),
inference(distribute,[status(thm)],[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])])])])])]) ).
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,negated_conjecture,
( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk3_1(X1)))
| X1 = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( X1 = esk3_1(X2)
| X2 = esk2_0
| ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk2_0
| X1 != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( esk3_1(X1) = esk3_1(X2)
| X1 = esk2_0
| X2 = esk2_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
fof(c_0_11,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_12,negated_conjecture,
( X1 = esk2_0
| X2 = esk2_0
| esk3_1(X1) != X2 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X469] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X469),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
( esk3_1(X1) = esk2_0
| X1 = esk2_0 ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
X1 = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW348+1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jun 19 08:38:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 1.07/1.27 Running first-order theorem proving
% 1.07/1.27 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.4qf9HdjUaR/E---3.1_30437.p
% 2.14/1.75 # Version: 3.2.0
% 2.14/1.75 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.14/1.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/1.75 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.14/1.75 # Starting new_bool_3 with 300s (1) cores
% 2.14/1.75 # Starting new_bool_1 with 300s (1) cores
% 2.14/1.75 # Starting sh5l with 300s (1) cores
% 2.14/1.75 # new_bool_3 with pid 30516 completed with status 0
% 2.14/1.75 # Result found by new_bool_3
% 2.14/1.75 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.14/1.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/1.75 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.14/1.75 # Starting new_bool_3 with 300s (1) cores
% 2.14/1.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.14/1.75 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.14/1.75 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.14/1.75 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.14/1.75 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 30519 completed with status 0
% 2.14/1.75 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 2.14/1.75 # Preprocessing class: FMLMSLSMSSSNFFN.
% 2.14/1.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.14/1.75 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 2.14/1.75 # Starting new_bool_3 with 300s (1) cores
% 2.14/1.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.14/1.75 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.14/1.75 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.14/1.75 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.14/1.75 # Preprocessing time : 0.014 s
% 2.14/1.75
% 2.14/1.75 # Proof found!
% 2.14/1.75 # SZS status Theorem
% 2.14/1.75 # SZS output start CNFRefutation
% See solution above
% 2.14/1.75 # Parsed axioms : 5227
% 2.14/1.75 # Removed by relevancy pruning/SinE : 4785
% 2.14/1.75 # Initial clauses : 677
% 2.14/1.75 # Removed in clause preprocessing : 29
% 2.14/1.75 # Initial clauses in saturation : 648
% 2.14/1.75 # Processed clauses : 915
% 2.14/1.75 # ...of these trivial : 53
% 2.14/1.75 # ...subsumed : 298
% 2.14/1.75 # ...remaining for further processing : 564
% 2.14/1.75 # Other redundant clauses eliminated : 120
% 2.14/1.75 # Clauses deleted for lack of memory : 0
% 2.14/1.75 # Backward-subsumed : 10
% 2.14/1.75 # Backward-rewritten : 526
% 2.14/1.75 # Generated clauses : 8267
% 2.14/1.75 # ...of the previous two non-redundant : 7567
% 2.14/1.75 # ...aggressively subsumed : 0
% 2.14/1.75 # Contextual simplify-reflections : 4
% 2.14/1.75 # Paramodulations : 8095
% 2.14/1.75 # Factorizations : 6
% 2.14/1.75 # NegExts : 0
% 2.14/1.75 # Equation resolutions : 167
% 2.14/1.75 # Disequality decompositions : 0
% 2.14/1.75 # Total rewrite steps : 2353
% 2.14/1.75 # ...of those cached : 1011
% 2.14/1.75 # Propositional unsat checks : 0
% 2.14/1.75 # Propositional check models : 0
% 2.14/1.75 # Propositional check unsatisfiable : 0
% 2.14/1.75 # Propositional clauses : 0
% 2.14/1.75 # Propositional clauses after purity: 0
% 2.14/1.75 # Propositional unsat core size : 0
% 2.14/1.75 # Propositional preprocessing time : 0.000
% 2.14/1.75 # Propositional encoding time : 0.000
% 2.14/1.75 # Propositional solver time : 0.000
% 2.14/1.75 # Success case prop preproc time : 0.000
% 2.14/1.75 # Success case prop encoding time : 0.000
% 2.14/1.75 # Success case prop solver time : 0.000
% 2.14/1.75 # Current number of processed clauses : 5
% 2.14/1.75 # Positive orientable unit clauses : 3
% 2.14/1.75 # Positive unorientable unit clauses: 1
% 2.14/1.75 # Negative unit clauses : 0
% 2.14/1.75 # Non-unit-clauses : 1
% 2.14/1.75 # Current number of unprocessed clauses: 7200
% 2.14/1.75 # ...number of literals in the above : 22852
% 2.14/1.75 # Current number of archived formulas : 0
% 2.14/1.75 # Current number of archived clauses : 536
% 2.14/1.75 # Clause-clause subsumption calls (NU) : 30293
% 2.14/1.75 # Rec. Clause-clause subsumption calls : 22994
% 2.14/1.75 # Non-unit clause-clause subsumptions : 183
% 2.14/1.75 # Unit Clause-clause subsumption calls : 1528
% 2.14/1.75 # Rewrite failures with RHS unbound : 27
% 2.14/1.75 # BW rewrite match attempts : 2565
% 2.14/1.75 # BW rewrite match successes : 891
% 2.14/1.75 # Condensation attempts : 0
% 2.14/1.75 # Condensation successes : 0
% 2.14/1.75 # Termbank termtop insertions : 424885
% 2.14/1.75 # Search garbage collected termcells : 55359
% 2.14/1.75
% 2.14/1.75 # -------------------------------------------------
% 2.14/1.75 # User time : 0.269 s
% 2.14/1.75 # System time : 0.021 s
% 2.14/1.75 # Total time : 0.291 s
% 2.14/1.75 # Maximum resident set size: 11248 pages
% 2.14/1.75
% 2.14/1.75 # -------------------------------------------------
% 2.14/1.75 # User time : 0.435 s
% 2.14/1.75 # System time : 0.031 s
% 2.14/1.75 # Total time : 0.466 s
% 2.14/1.75 # Maximum resident set size: 9596 pages
% 2.14/1.75 % E---3.1 exiting
% 2.14/1.75 % E exiting
%------------------------------------------------------------------------------