TSTP Solution File: SWV972-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV972-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 05:32:44 EDT 2024
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-5 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-5 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( v_thesis____
| ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),X1,v_Us____,tc_Type_Oty,tc_Type_Oty)
| ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_1,axiom,
c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____),v_Us____,tc_Type_Oty,tc_Type_Oty),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_1) ).
cnf(cls_CHAINED_0,axiom,
c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_0_4,plain,
( v_thesis____
| ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),X1,v_Us____,tc_Type_Oty,tc_Type_Oty)
| ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,X1) ),
inference(fof_simplification,[status(thm)],[cls_that_0]) ).
cnf(c_0_5,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_6,plain,
( v_thesis____
| ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),X1,v_Us____,tc_Type_Oty,tc_Type_Oty)
| ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,X1) ),
c_0_4 ).
cnf(c_0_7,negated_conjecture,
~ v_thesis____,
c_0_5 ).
cnf(c_0_8,plain,
( ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,X1)
| ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),X1,v_Us____,tc_Type_Oty,tc_Type_Oty) ),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____),v_Us____,tc_Type_Oty,tc_Type_Oty),
cls_CHAINED_1 ).
cnf(c_0_10,axiom,
c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____)),
cls_CHAINED_0 ).
cnf(c_0_11,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV972-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 06:27:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 11656 completed with status 0
% 0.20/0.53 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.20/0.53 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FSLM33-DFFFFFNN
% 0.20/0.53 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 0.20/0.53 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.53 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 11666 completed with status 0
% 0.20/0.53 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FSLM33-DFFFFFNN
% 0.20/0.53 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 0.20/0.53 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 0.20/0.53 # Preprocessing time : 0.013 s
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 508
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 508
% 0.20/0.53 # Removed in clause preprocessing : 3
% 0.20/0.53 # Initial clauses in saturation : 505
% 0.20/0.53 # Processed clauses : 111
% 0.20/0.53 # ...of these trivial : 3
% 0.20/0.53 # ...subsumed : 9
% 0.20/0.53 # ...remaining for further processing : 99
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 0
% 0.20/0.53 # Generated clauses : 29
% 0.20/0.53 # ...of the previous two non-redundant : 20
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 24
% 0.20/0.53 # Factorizations : 2
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 3
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 9
% 0.20/0.53 # ...of those cached : 3
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 99
% 0.20/0.53 # Positive orientable unit clauses : 66
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 6
% 0.20/0.53 # Non-unit-clauses : 27
% 0.20/0.53 # Current number of unprocessed clauses: 414
% 0.20/0.53 # ...number of literals in the above : 865
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 2
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 227
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 163
% 0.20/0.53 # Non-unit clause-clause subsumptions : 4
% 0.20/0.53 # Unit Clause-clause subsumption calls : 21
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 7
% 0.20/0.53 # BW rewrite match successes : 0
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 11543
% 0.20/0.53 # Search garbage collected termcells : 894
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.021 s
% 0.20/0.53 # System time : 0.010 s
% 0.20/0.53 # Total time : 0.030 s
% 0.20/0.53 # Maximum resident set size: 2748 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.064 s
% 0.20/0.53 # System time : 0.023 s
% 0.20/0.53 # Total time : 0.086 s
% 0.20/0.53 # Maximum resident set size: 2080 pages
% 0.20/0.53 % E---3.1 exiting
% 0.53/0.53 % E exiting
%------------------------------------------------------------------------------