TSTP Solution File: SWW350+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW350+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:09:11 EDT 2023
% Result : Theorem 1.98s 2.45s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 39 ( 25 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 13 ~; 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 : 28 ( 2 sgn; 13 !; 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.pqvtIcFHrz/E---3.1_10760.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.pqvtIcFHrz/E---3.1_10760.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.pqvtIcFHrz/E---3.1_10760.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.pqvtIcFHrz/E---3.1_10760.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(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(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]) ).
cnf(c_0_11,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_12,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_13,plain,
! [X468] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X468),
inference(variable_rename,[status(thm)],[fact_com_Osimps_I18_J]) ).
cnf(c_0_14,hypothesis,
( esk1_1(X1) = v_s_H
| X1 = v_s_H ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
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,hypothesis,
X1 = v_s_H,
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.86/0.90 % Problem : SWW350+1 : TPTP v8.1.2. Released v5.2.0.
% 0.86/0.91 % Command : run_E %s %d THM
% 0.93/1.11 % Computer : n008.cluster.edu
% 0.93/1.11 % Model : x86_64 x86_64
% 0.93/1.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.93/1.11 % Memory : 8042.1875MB
% 0.93/1.11 % OS : Linux 3.10.0-693.el7.x86_64
% 0.93/1.11 % CPULimit : 2400
% 0.93/1.11 % WCLimit : 300
% 0.93/1.11 % DateTime : Mon Oct 2 22:22:58 EDT 2023
% 0.93/1.11 % CPUTime :
% 1.81/2.01 Running first-order theorem proving
% 1.81/2.01 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.pqvtIcFHrz/E---3.1_10760.p
% 1.98/2.45 # Version: 3.1pre001
% 1.98/2.45 # Preprocessing class: FMLMSLSMSSSNFFN.
% 1.98/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/2.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.98/2.45 # Starting new_bool_3 with 300s (1) cores
% 1.98/2.45 # Starting new_bool_1 with 300s (1) cores
% 1.98/2.45 # Starting sh5l with 300s (1) cores
% 1.98/2.45 # new_bool_1 with pid 10840 completed with status 0
% 1.98/2.45 # Result found by new_bool_1
% 1.98/2.45 # Preprocessing class: FMLMSLSMSSSNFFN.
% 1.98/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/2.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.98/2.45 # Starting new_bool_3 with 300s (1) cores
% 1.98/2.45 # Starting new_bool_1 with 300s (1) cores
% 1.98/2.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.98/2.45 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.98/2.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.98/2.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.98/2.45 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 10842 completed with status 0
% 1.98/2.45 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.98/2.45 # Preprocessing class: FMLMSLSMSSSNFFN.
% 1.98/2.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.98/2.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.98/2.45 # Starting new_bool_3 with 300s (1) cores
% 1.98/2.45 # Starting new_bool_1 with 300s (1) cores
% 1.98/2.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.98/2.45 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.98/2.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.98/2.45 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.98/2.45 # Preprocessing time : 0.014 s
% 1.98/2.45
% 1.98/2.45 # Proof found!
% 1.98/2.45 # SZS status Theorem
% 1.98/2.45 # SZS output start CNFRefutation
% See solution above
% 1.98/2.45 # Parsed axioms : 5229
% 1.98/2.45 # Removed by relevancy pruning/SinE : 4785
% 1.98/2.45 # Initial clauses : 678
% 1.98/2.45 # Removed in clause preprocessing : 29
% 1.98/2.45 # Initial clauses in saturation : 649
% 1.98/2.45 # Processed clauses : 957
% 1.98/2.45 # ...of these trivial : 56
% 1.98/2.45 # ...subsumed : 319
% 1.98/2.45 # ...remaining for further processing : 582
% 1.98/2.45 # Other redundant clauses eliminated : 135
% 1.98/2.45 # Clauses deleted for lack of memory : 0
% 1.98/2.45 # Backward-subsumed : 10
% 1.98/2.45 # Backward-rewritten : 544
% 1.98/2.45 # Generated clauses : 9083
% 1.98/2.45 # ...of the previous two non-redundant : 8366
% 1.98/2.45 # ...aggressively subsumed : 0
% 1.98/2.45 # Contextual simplify-reflections : 5
% 1.98/2.45 # Paramodulations : 8894
% 1.98/2.45 # Factorizations : 6
% 1.98/2.45 # NegExts : 0
% 1.98/2.45 # Equation resolutions : 184
% 1.98/2.45 # Total rewrite steps : 2436
% 1.98/2.45 # Propositional unsat checks : 0
% 1.98/2.45 # Propositional check models : 0
% 1.98/2.45 # Propositional check unsatisfiable : 0
% 1.98/2.45 # Propositional clauses : 0
% 1.98/2.45 # Propositional clauses after purity: 0
% 1.98/2.45 # Propositional unsat core size : 0
% 1.98/2.45 # Propositional preprocessing time : 0.000
% 1.98/2.45 # Propositional encoding time : 0.000
% 1.98/2.45 # Propositional solver time : 0.000
% 1.98/2.45 # Success case prop preproc time : 0.000
% 1.98/2.45 # Success case prop encoding time : 0.000
% 1.98/2.45 # Success case prop solver time : 0.000
% 1.98/2.45 # Current number of processed clauses : 5
% 1.98/2.45 # Positive orientable unit clauses : 3
% 1.98/2.45 # Positive unorientable unit clauses: 1
% 1.98/2.45 # Negative unit clauses : 0
% 1.98/2.45 # Non-unit-clauses : 1
% 1.98/2.45 # Current number of unprocessed clauses: 7950
% 1.98/2.45 # ...number of literals in the above : 26130
% 1.98/2.45 # Current number of archived formulas : 0
% 1.98/2.45 # Current number of archived clauses : 554
% 1.98/2.45 # Clause-clause subsumption calls (NU) : 34202
% 1.98/2.45 # Rec. Clause-clause subsumption calls : 25375
% 1.98/2.45 # Non-unit clause-clause subsumptions : 191
% 1.98/2.45 # Unit Clause-clause subsumption calls : 1772
% 1.98/2.45 # Rewrite failures with RHS unbound : 27
% 1.98/2.45 # BW rewrite match attempts : 2606
% 1.98/2.45 # BW rewrite match successes : 911
% 1.98/2.45 # Condensation attempts : 0
% 1.98/2.45 # Condensation successes : 0
% 1.98/2.45 # Termbank termtop insertions : 449660
% 1.98/2.45
% 1.98/2.45 # -------------------------------------------------
% 1.98/2.45 # User time : 0.251 s
% 1.98/2.45 # System time : 0.024 s
% 1.98/2.45 # Total time : 0.275 s
% 1.98/2.45 # Maximum resident set size: 11224 pages
% 1.98/2.45
% 1.98/2.45 # -------------------------------------------------
% 1.98/2.45 # User time : 0.390 s
% 1.98/2.45 # System time : 0.029 s
% 1.98/2.45 # Total time : 0.419 s
% 1.98/2.45 # Maximum resident set size: 9592 pages
% 1.98/2.45 % E---3.1 exiting
% 1.98/2.45 % E---3.1 exiting
%------------------------------------------------------------------------------