TSTP Solution File: SWW344+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW344+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 : Tue May 21 06:42:21 EDT 2024
% Result : Theorem 3.17s 1.61s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 14 ~; 10 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
v_R(v_Z,v_s_H),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_6) ).
fof(conj_2,hypothesis,
! [X9,X10] :
( v_Q(X9,X10)
=> ! [X11] :
( c_Natural_Oevaln(v_d,X10,v_n,X11)
=> v_R(X9,X11) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).
fof(conj_5,hypothesis,
c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_5) ).
fof(conj_1,hypothesis,
! [X9,X10] :
( v_P(X9,X10)
=> ! [X11] :
( c_Natural_Oevaln(v_c,X10,v_n,X11)
=> v_Q(X9,X11) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(conj_4,hypothesis,
c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
fof(conj_3,hypothesis,
v_P(v_Z,v_s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_3) ).
fof(c_0_6,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).
fof(c_0_7,hypothesis,
! [X334,X335,X336] :
( ~ v_Q(X334,X335)
| ~ c_Natural_Oevaln(v_d,X335,v_n,X336)
| v_R(X334,X336) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_2])])])]) ).
fof(c_0_8,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( v_R(X1,X3)
| ~ v_Q(X1,X2)
| ~ c_Natural_Oevaln(v_d,X2,v_n,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
inference(split_conjunct,[status(thm)],[conj_5]) ).
fof(c_0_11,hypothesis,
! [X331,X332,X333] :
( ~ v_P(X331,X332)
| ~ c_Natural_Oevaln(v_c,X332,v_n,X333)
| v_Q(X331,X333) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])]) ).
cnf(c_0_12,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( v_R(X1,v_s_H)
| ~ v_Q(X1,v_s1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
( v_Q(X1,X3)
| ~ v_P(X1,X2)
| ~ c_Natural_Oevaln(v_c,X2,v_n,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
inference(split_conjunct,[status(thm)],[conj_4]) ).
cnf(c_0_16,negated_conjecture,
~ v_Q(v_Z,v_s1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
( v_Q(X1,v_s1)
| ~ v_P(X1,v_s) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
v_P(v_Z,v_s),
inference(split_conjunct,[status(thm)],[conj_3]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW344+1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 19:00:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 3.17/1.61 # Version: 3.1.0
% 3.17/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/1.61 # Starting new_bool_3 with 300s (1) cores
% 3.17/1.61 # Starting new_bool_1 with 300s (1) cores
% 3.17/1.61 # Starting sh5l with 300s (1) cores
% 3.17/1.61 # new_bool_3 with pid 5705 completed with status 0
% 3.17/1.61 # Result found by new_bool_3
% 3.17/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/1.61 # Starting new_bool_3 with 300s (1) cores
% 3.17/1.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.17/1.61 # Search class: FGHSM-SSLM32-DFFFFFNN
% 3.17/1.61 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.17/1.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 3.17/1.61 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 5708 completed with status 0
% 3.17/1.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 3.17/1.61 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/1.61 # Starting new_bool_3 with 300s (1) cores
% 3.17/1.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.17/1.61 # Search class: FGHSM-SSLM32-DFFFFFNN
% 3.17/1.61 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.17/1.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 3.17/1.61 # Preprocessing time : 0.024 s
% 3.17/1.61 # Presaturation interreduction done
% 3.17/1.61
% 3.17/1.61 # Proof found!
% 3.17/1.61 # SZS status Theorem
% 3.17/1.61 # SZS output start CNFRefutation
% See solution above
% 3.17/1.61 # Parsed axioms : 5211
% 3.17/1.61 # Removed by relevancy pruning/SinE : 4451
% 3.17/1.61 # Initial clauses : 1144
% 3.17/1.61 # Removed in clause preprocessing : 56
% 3.17/1.61 # Initial clauses in saturation : 1088
% 3.17/1.61 # Processed clauses : 1894
% 3.17/1.61 # ...of these trivial : 35
% 3.17/1.61 # ...subsumed : 263
% 3.17/1.61 # ...remaining for further processing : 1596
% 3.17/1.61 # Other redundant clauses eliminated : 295
% 3.17/1.61 # Clauses deleted for lack of memory : 0
% 3.17/1.61 # Backward-subsumed : 6
% 3.17/1.61 # Backward-rewritten : 21
% 3.17/1.61 # Generated clauses : 15753
% 3.17/1.61 # ...of the previous two non-redundant : 14022
% 3.17/1.61 # ...aggressively subsumed : 0
% 3.17/1.61 # Contextual simplify-reflections : 5
% 3.17/1.61 # Paramodulations : 15417
% 3.17/1.61 # Factorizations : 8
% 3.17/1.61 # NegExts : 0
% 3.17/1.61 # Equation resolutions : 339
% 3.17/1.61 # Disequality decompositions : 0
% 3.17/1.61 # Total rewrite steps : 5330
% 3.17/1.61 # ...of those cached : 3697
% 3.17/1.61 # Propositional unsat checks : 0
% 3.17/1.61 # Propositional check models : 0
% 3.17/1.61 # Propositional check unsatisfiable : 0
% 3.17/1.61 # Propositional clauses : 0
% 3.17/1.61 # Propositional clauses after purity: 0
% 3.17/1.61 # Propositional unsat core size : 0
% 3.17/1.61 # Propositional preprocessing time : 0.000
% 3.17/1.61 # Propositional encoding time : 0.000
% 3.17/1.61 # Propositional solver time : 0.000
% 3.17/1.61 # Success case prop preproc time : 0.000
% 3.17/1.61 # Success case prop encoding time : 0.000
% 3.17/1.61 # Success case prop solver time : 0.000
% 3.17/1.61 # Current number of processed clauses : 746
% 3.17/1.61 # Positive orientable unit clauses : 156
% 3.17/1.61 # Positive unorientable unit clauses: 21
% 3.17/1.61 # Negative unit clauses : 49
% 3.17/1.61 # Non-unit-clauses : 520
% 3.17/1.61 # Current number of unprocessed clauses: 13959
% 3.17/1.61 # ...number of literals in the above : 37819
% 3.17/1.61 # Current number of archived formulas : 0
% 3.17/1.61 # Current number of archived clauses : 770
% 3.17/1.61 # Clause-clause subsumption calls (NU) : 112314
% 3.17/1.61 # Rec. Clause-clause subsumption calls : 90459
% 3.17/1.61 # Non-unit clause-clause subsumptions : 202
% 3.17/1.61 # Unit Clause-clause subsumption calls : 2739
% 3.17/1.61 # Rewrite failures with RHS unbound : 0
% 3.17/1.61 # BW rewrite match attempts : 3502
% 3.17/1.61 # BW rewrite match successes : 184
% 3.17/1.61 # Condensation attempts : 0
% 3.17/1.61 # Condensation successes : 0
% 3.17/1.61 # Termbank termtop insertions : 771054
% 3.17/1.61 # Search garbage collected termcells : 57655
% 3.17/1.61
% 3.17/1.61 # -------------------------------------------------
% 3.17/1.61 # User time : 0.741 s
% 3.17/1.61 # System time : 0.027 s
% 3.17/1.61 # Total time : 0.768 s
% 3.17/1.61 # Maximum resident set size: 11972 pages
% 3.17/1.61
% 3.17/1.61 # -------------------------------------------------
% 3.17/1.61 # User time : 1.072 s
% 3.17/1.61 # System time : 0.037 s
% 3.17/1.61 # Total time : 1.109 s
% 3.17/1.61 # Maximum resident set size: 9484 pages
% 3.17/1.61 % E---3.1 exiting
% 3.17/1.61 % E exiting
%------------------------------------------------------------------------------