TSTP Solution File: SWW342+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW342+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Sat May 4 10:00:50 EDT 2024
% Result : Theorem 3.05s 2.58s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 20 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X14,X15] :
( v_P(X14,X15)
=> ! [X16] :
( c_Natural_Oevaln(c_Com_Ocom_OSKIP,X15,v_n,X16)
=> v_P(X14,X16) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ys0OQH5WHz/E---3.1_25333.p',conj_1) ).
fof(fact_evaln__elim__cases_I1_J,axiom,
! [X6,X4,X5] :
( c_Natural_Oevaln(c_Com_Ocom_OSKIP,X5,X4,X6)
=> X6 = X5 ),
file('/export/starexec/sandbox2/tmp/tmp.Ys0OQH5WHz/E---3.1_25333.p',fact_evaln__elim__cases_I1_J) ).
fof(c_0_2,negated_conjecture,
~ ! [X14,X15] :
( v_P(X14,X15)
=> ! [X16] :
( c_Natural_Oevaln(c_Com_Ocom_OSKIP,X15,v_n,X16)
=> v_P(X14,X16) ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_3,plain,
! [X472,X473,X474] :
( ~ c_Natural_Oevaln(c_Com_Ocom_OSKIP,X474,X473,X472)
| X472 = X474 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_evaln__elim__cases_I1_J])])]) ).
fof(c_0_4,negated_conjecture,
( v_P(esk1_0,esk2_0)
& c_Natural_Oevaln(c_Com_Ocom_OSKIP,esk2_0,v_n,esk3_0)
& ~ v_P(esk1_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( X3 = X1
| ~ c_Natural_Oevaln(c_Com_Ocom_OSKIP,X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
c_Natural_Oevaln(c_Com_Ocom_OSKIP,esk2_0,v_n,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ v_P(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk3_0 = esk2_0,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
v_P(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.85/0.86 % Problem : SWW342+1 : TPTP v8.1.2. Released v5.2.0.
% 0.85/0.87 % Command : run_E %s %d THM
% 0.90/1.08 % Computer : n024.cluster.edu
% 0.90/1.08 % Model : x86_64 x86_64
% 0.90/1.08 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.90/1.08 % Memory : 8042.1875MB
% 0.90/1.08 % OS : Linux 3.10.0-693.el7.x86_64
% 0.90/1.08 % CPULimit : 300
% 0.90/1.08 % WCLimit : 300
% 0.90/1.08 % DateTime : Fri May 3 13:27:21 EDT 2024
% 0.90/1.08 % CPUTime :
% 1.76/1.93 Running first-order theorem proving
% 1.76/1.93 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.Ys0OQH5WHz/E---3.1_25333.p
% 3.05/2.58 # Version: 3.1.0
% 3.05/2.58 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.05/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.05/2.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.05/2.58 # Starting new_bool_3 with 300s (1) cores
% 3.05/2.58 # Starting new_bool_1 with 300s (1) cores
% 3.05/2.58 # Starting sh5l with 300s (1) cores
% 3.05/2.58 # new_bool_3 with pid 25487 completed with status 0
% 3.05/2.58 # Result found by new_bool_3
% 3.05/2.58 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.05/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.05/2.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.05/2.58 # Starting new_bool_3 with 300s (1) cores
% 3.05/2.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.05/2.58 # Search class: FGHSM-SSLM32-DFFFFFNN
% 3.05/2.58 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.05/2.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 3.05/2.58 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 25491 completed with status 0
% 3.05/2.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 3.05/2.58 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.05/2.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.05/2.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.05/2.58 # Starting new_bool_3 with 300s (1) cores
% 3.05/2.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.05/2.58 # Search class: FGHSM-SSLM32-DFFFFFNN
% 3.05/2.58 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.05/2.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 3.05/2.58 # Preprocessing time : 0.027 s
% 3.05/2.58 # Presaturation interreduction done
% 3.05/2.58
% 3.05/2.58 # Proof found!
% 3.05/2.58 # SZS status Theorem
% 3.05/2.58 # SZS output start CNFRefutation
% See solution above
% 3.05/2.58 # Parsed axioms : 5206
% 3.05/2.58 # Removed by relevancy pruning/SinE : 4444
% 3.05/2.58 # Initial clauses : 1149
% 3.05/2.58 # Removed in clause preprocessing : 56
% 3.05/2.58 # Initial clauses in saturation : 1093
% 3.05/2.58 # Processed clauses : 1887
% 3.05/2.58 # ...of these trivial : 36
% 3.05/2.58 # ...subsumed : 256
% 3.05/2.58 # ...remaining for further processing : 1595
% 3.05/2.58 # Other redundant clauses eliminated : 303
% 3.05/2.58 # Clauses deleted for lack of memory : 0
% 3.05/2.58 # Backward-subsumed : 6
% 3.05/2.58 # Backward-rewritten : 24
% 3.05/2.58 # Generated clauses : 16545
% 3.05/2.58 # ...of the previous two non-redundant : 14779
% 3.05/2.58 # ...aggressively subsumed : 0
% 3.05/2.58 # Contextual simplify-reflections : 5
% 3.05/2.58 # Paramodulations : 16201
% 3.05/2.58 # Factorizations : 8
% 3.05/2.58 # NegExts : 0
% 3.05/2.58 # Equation resolutions : 347
% 3.05/2.58 # Disequality decompositions : 0
% 3.05/2.58 # Total rewrite steps : 5545
% 3.05/2.58 # ...of those cached : 3851
% 3.05/2.58 # Propositional unsat checks : 0
% 3.05/2.58 # Propositional check models : 0
% 3.05/2.58 # Propositional check unsatisfiable : 0
% 3.05/2.58 # Propositional clauses : 0
% 3.05/2.58 # Propositional clauses after purity: 0
% 3.05/2.58 # Propositional unsat core size : 0
% 3.05/2.58 # Propositional preprocessing time : 0.000
% 3.05/2.58 # Propositional encoding time : 0.000
% 3.05/2.58 # Propositional solver time : 0.000
% 3.05/2.58 # Success case prop preproc time : 0.000
% 3.05/2.58 # Success case prop encoding time : 0.000
% 3.05/2.58 # Success case prop solver time : 0.000
% 3.05/2.58 # Current number of processed clauses : 739
% 3.05/2.58 # Positive orientable unit clauses : 154
% 3.05/2.58 # Positive unorientable unit clauses: 20
% 3.05/2.58 # Negative unit clauses : 46
% 3.05/2.58 # Non-unit-clauses : 519
% 3.05/2.58 # Current number of unprocessed clauses: 14731
% 3.05/2.58 # ...number of literals in the above : 39595
% 3.05/2.58 # Current number of archived formulas : 0
% 3.05/2.58 # Current number of archived clauses : 776
% 3.05/2.58 # Clause-clause subsumption calls (NU) : 96266
% 3.05/2.58 # Rec. Clause-clause subsumption calls : 77239
% 3.05/2.58 # Non-unit clause-clause subsumptions : 201
% 3.05/2.58 # Unit Clause-clause subsumption calls : 2060
% 3.05/2.58 # Rewrite failures with RHS unbound : 0
% 3.05/2.58 # BW rewrite match attempts : 3517
% 3.05/2.58 # BW rewrite match successes : 192
% 3.05/2.58 # Condensation attempts : 0
% 3.05/2.58 # Condensation successes : 0
% 3.05/2.58 # Termbank termtop insertions : 795220
% 3.05/2.58 # Search garbage collected termcells : 57894
% 3.05/2.58
% 3.05/2.58 # -------------------------------------------------
% 3.05/2.58 # User time : 0.489 s
% 3.05/2.58 # System time : 0.034 s
% 3.05/2.58 # Total time : 0.522 s
% 3.05/2.58 # Maximum resident set size: 12004 pages
% 3.05/2.58
% 3.05/2.58 # -------------------------------------------------
% 3.05/2.58 # User time : 0.590 s
% 3.05/2.58 # System time : 0.045 s
% 3.05/2.58 # Total time : 0.634 s
% 3.05/2.58 # Maximum resident set size: 9588 pages
% 3.05/2.58 % E---3.1 exiting
% 3.05/2.58 % E exiting
%------------------------------------------------------------------------------