TSTP Solution File: SWV857-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV857-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 19:55:30 EDT 2023
% Result : Unsatisfiable 0.47s 0.77s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 31 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_Ga)) ),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_conjecture_3) ).
cnf(cls_mem__def_1,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_mem__def_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_conjecture_2) ).
cnf(cls_rev__predicate1D_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ c_lessequals(X3,X1,tc_fun(X4,tc_bool))
| ~ hBOOL(hAPP(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_rev__predicate1D_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_tsa,v_Ga,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_conjecture_0) ).
cnf(cls_mem__def_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_mem__def_0) ).
cnf(cls_conjecture_1,negated_conjecture,
hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
file('/export/starexec/sandbox/tmp/tmp.4BOnAGIHQP/E---3.1_31204.p',cls_conjecture_1) ).
cnf(c_0_7,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_Ga)) ),
cls_conjecture_3 ).
cnf(c_0_8,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(X3,X2)) ),
cls_mem__def_1 ).
cnf(c_0_9,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
cls_conjecture_2 ).
cnf(c_0_10,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(v_Ga,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( hBOOL(hAPP(X1,X2))
| ~ c_lessequals(X3,X1,tc_fun(X4,tc_bool))
| ~ hBOOL(hAPP(X3,X2)) ),
cls_rev__predicate1D_0 ).
cnf(c_0_12,negated_conjecture,
c_lessequals(v_tsa,v_Ga,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
cls_conjecture_0 ).
cnf(c_0_13,axiom,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1)) ),
cls_mem__def_0 ).
cnf(c_0_14,negated_conjecture,
hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
cls_conjecture_1 ).
cnf(c_0_15,negated_conjecture,
~ hBOOL(hAPP(v_Ga,v_xa)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( hBOOL(hAPP(v_Ga,X1))
| ~ hBOOL(hAPP(v_tsa,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
hBOOL(hAPP(v_tsa,v_xa)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.17 % Problem : SWV857-1 : TPTP v8.1.2. Released v4.1.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.20/0.39 % Computer : n010.cluster.edu
% 0.20/0.39 % Model : x86_64 x86_64
% 0.20/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.39 % Memory : 8042.1875MB
% 0.20/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.40 % CPULimit : 2400
% 0.20/0.40 % WCLimit : 300
% 0.20/0.40 % DateTime : Tue Oct 3 03:45:35 EDT 2023
% 0.20/0.40 % CPUTime :
% 0.40/0.61 Running first-order theorem proving
% 0.40/0.61 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.4BOnAGIHQP/E---3.1_31204.p
% 0.47/0.77 # Version: 3.1pre001
% 0.47/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.77 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.77 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.77 # Starting sh5l with 300s (1) cores
% 0.47/0.77 # new_bool_1 with pid 31372 completed with status 0
% 0.47/0.77 # Result found by new_bool_1
% 0.47/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.77 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.77 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.77 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.47/0.77 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.77 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.47/0.77 # G-E--_303_C18_F1_URBAN_S0Y with pid 31374 completed with status 0
% 0.47/0.77 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.47/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.77 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.77 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.77 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.47/0.77 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.77 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.47/0.77 # Preprocessing time : 0.007 s
% 0.47/0.77
% 0.47/0.77 # Proof found!
% 0.47/0.77 # SZS status Unsatisfiable
% 0.47/0.77 # SZS output start CNFRefutation
% See solution above
% 0.47/0.77 # Parsed axioms : 586
% 0.47/0.77 # Removed by relevancy pruning/SinE : 281
% 0.47/0.77 # Initial clauses : 305
% 0.47/0.77 # Removed in clause preprocessing : 0
% 0.47/0.77 # Initial clauses in saturation : 305
% 0.47/0.77 # Processed clauses : 346
% 0.47/0.77 # ...of these trivial : 15
% 0.47/0.77 # ...subsumed : 64
% 0.47/0.77 # ...remaining for further processing : 267
% 0.47/0.77 # Other redundant clauses eliminated : 3
% 0.47/0.77 # Clauses deleted for lack of memory : 0
% 0.47/0.77 # Backward-subsumed : 0
% 0.47/0.77 # Backward-rewritten : 6
% 0.47/0.77 # Generated clauses : 5490
% 0.47/0.77 # ...of the previous two non-redundant : 4498
% 0.47/0.77 # ...aggressively subsumed : 0
% 0.47/0.77 # Contextual simplify-reflections : 3
% 0.47/0.77 # Paramodulations : 5480
% 0.47/0.77 # Factorizations : 0
% 0.47/0.77 # NegExts : 0
% 0.47/0.77 # Equation resolutions : 10
% 0.47/0.77 # Total rewrite steps : 2434
% 0.47/0.77 # Propositional unsat checks : 0
% 0.47/0.77 # Propositional check models : 0
% 0.47/0.77 # Propositional check unsatisfiable : 0
% 0.47/0.77 # Propositional clauses : 0
% 0.47/0.77 # Propositional clauses after purity: 0
% 0.47/0.77 # Propositional unsat core size : 0
% 0.47/0.77 # Propositional preprocessing time : 0.000
% 0.47/0.77 # Propositional encoding time : 0.000
% 0.47/0.77 # Propositional solver time : 0.000
% 0.47/0.77 # Success case prop preproc time : 0.000
% 0.47/0.77 # Success case prop encoding time : 0.000
% 0.47/0.77 # Success case prop solver time : 0.000
% 0.47/0.77 # Current number of processed clauses : 261
% 0.47/0.77 # Positive orientable unit clauses : 74
% 0.47/0.77 # Positive unorientable unit clauses: 11
% 0.47/0.77 # Negative unit clauses : 10
% 0.47/0.77 # Non-unit-clauses : 166
% 0.47/0.77 # Current number of unprocessed clauses: 4457
% 0.47/0.77 # ...number of literals in the above : 10060
% 0.47/0.77 # Current number of archived formulas : 0
% 0.47/0.77 # Current number of archived clauses : 6
% 0.47/0.77 # Clause-clause subsumption calls (NU) : 1889
% 0.47/0.77 # Rec. Clause-clause subsumption calls : 1683
% 0.47/0.77 # Non-unit clause-clause subsumptions : 44
% 0.47/0.77 # Unit Clause-clause subsumption calls : 422
% 0.47/0.77 # Rewrite failures with RHS unbound : 0
% 0.47/0.77 # BW rewrite match attempts : 415
% 0.47/0.77 # BW rewrite match successes : 45
% 0.47/0.77 # Condensation attempts : 0
% 0.47/0.77 # Condensation successes : 0
% 0.47/0.77 # Termbank termtop insertions : 108470
% 0.47/0.77
% 0.47/0.77 # -------------------------------------------------
% 0.47/0.77 # User time : 0.113 s
% 0.47/0.77 # System time : 0.009 s
% 0.47/0.77 # Total time : 0.122 s
% 0.47/0.77 # Maximum resident set size: 2504 pages
% 0.47/0.77
% 0.47/0.77 # -------------------------------------------------
% 0.47/0.77 # User time : 0.141 s
% 0.47/0.77 # System time : 0.011 s
% 0.47/0.77 # Total time : 0.153 s
% 0.47/0.77 # Maximum resident set size: 2108 pages
% 0.47/0.77 % E---3.1 exiting
% 0.47/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------