TSTP Solution File: SWV858-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV858-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:08:00 EDT 2023
% Result : Unsatisfiable 0.39s 0.69s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 9 unt; 5 nHn; 22 RR)
% Number of literals : 58 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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.7fWA2hO6MF/E---3.1_28571.p',cls_rev__predicate1D_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_tsa,v_ts_H,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_1) ).
cnf(cls_mem__def_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1)) ),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_mem__def_0) ).
cnf(cls_conjecture_2,negated_conjecture,
hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_2) ).
cnf(cls_conjecture_5,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H)) ),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_5) ).
cnf(cls_mem__def_1,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(X3,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_mem__def_1) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
| ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a) ),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_6) ).
cnf(cls_conjecture_4,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.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
file('/export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p',cls_conjecture_3) ).
cnf(c_0_9,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_10,negated_conjecture,
c_lessequals(v_tsa,v_ts_H,tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),
cls_conjecture_1 ).
cnf(c_0_11,axiom,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1)) ),
cls_mem__def_0 ).
cnf(c_0_12,negated_conjecture,
hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_xa),v_tsa)),
cls_conjecture_2 ).
cnf(c_0_13,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H)) ),
cls_conjecture_5 ).
cnf(c_0_14,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(X3,X2)) ),
cls_mem__def_1 ).
cnf(c_0_15,negated_conjecture,
( hBOOL(hAPP(v_ts_H,X1))
| ~ hBOOL(hAPP(v_tsa,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
hBOOL(hAPP(v_tsa,v_xa)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| ~ hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),X2),v_ts_H))
| ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a) ),
cls_conjecture_6 ).
cnf(c_0_18,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_4 ).
cnf(c_0_19,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga))
| ~ hBOOL(hAPP(v_ts_H,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
hBOOL(hAPP(v_ts_H,v_xa)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,t_a)
| ~ c_Hoare__Mirabelle_Otriple__valid(X1,v_n(X1),t_a)
| ~ hBOOL(hAPP(v_ts_H,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(v_Ga,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,v_xa,t_a)
| hBOOL(hAPP(hAPP(c_in(tc_Hoare__Mirabelle_Otriple(t_a)),v_n(X1)),v_Ga)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(v_Ga,v_n(v_x)))
| ~ hBOOL(hAPP(v_ts_H,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(X1,v_xa,t_a)
| hBOOL(hAPP(v_Ga,v_n(X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(v_x,v_xa,t_a),
cls_conjecture_3 ).
cnf(c_0_27,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(v_x,X1,t_a)
| ~ hBOOL(hAPP(v_ts_H,X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV858-1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 03:36:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.53 Running first-order model finding
% 0.20/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.7fWA2hO6MF/E---3.1_28571.p
% 0.39/0.69 # Version: 3.1pre001
% 0.39/0.69 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.69 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.69 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.69 # Starting sh5l with 300s (1) cores
% 0.39/0.69 # new_bool_3 with pid 28728 completed with status 0
% 0.39/0.69 # Result found by new_bool_3
% 0.39/0.69 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.69 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.69 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.39/0.69 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.69 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.39/0.69 # G-E--_303_C18_F1_URBAN_S0Y with pid 28732 completed with status 0
% 0.39/0.69 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.39/0.69 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.69 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.69 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.39/0.69 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.69 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.39/0.69 # Preprocessing time : 0.009 s
% 0.39/0.69
% 0.39/0.69 # Proof found!
% 0.39/0.69 # SZS status Unsatisfiable
% 0.39/0.69 # SZS output start CNFRefutation
% See solution above
% 0.39/0.69 # Parsed axioms : 593
% 0.39/0.69 # Removed by relevancy pruning/SinE : 282
% 0.39/0.69 # Initial clauses : 311
% 0.39/0.69 # Removed in clause preprocessing : 0
% 0.39/0.69 # Initial clauses in saturation : 311
% 0.39/0.69 # Processed clauses : 438
% 0.39/0.69 # ...of these trivial : 16
% 0.39/0.69 # ...subsumed : 104
% 0.39/0.69 # ...remaining for further processing : 318
% 0.39/0.69 # Other redundant clauses eliminated : 4
% 0.39/0.69 # Clauses deleted for lack of memory : 0
% 0.39/0.69 # Backward-subsumed : 1
% 0.39/0.69 # Backward-rewritten : 6
% 0.39/0.69 # Generated clauses : 5944
% 0.39/0.69 # ...of the previous two non-redundant : 4878
% 0.39/0.69 # ...aggressively subsumed : 0
% 0.39/0.69 # Contextual simplify-reflections : 3
% 0.39/0.69 # Paramodulations : 5934
% 0.39/0.69 # Factorizations : 0
% 0.39/0.69 # NegExts : 0
% 0.39/0.69 # Equation resolutions : 10
% 0.39/0.69 # Total rewrite steps : 2634
% 0.39/0.69 # Propositional unsat checks : 0
% 0.39/0.69 # Propositional check models : 0
% 0.39/0.69 # Propositional check unsatisfiable : 0
% 0.39/0.69 # Propositional clauses : 0
% 0.39/0.69 # Propositional clauses after purity: 0
% 0.39/0.69 # Propositional unsat core size : 0
% 0.39/0.69 # Propositional preprocessing time : 0.000
% 0.39/0.69 # Propositional encoding time : 0.000
% 0.39/0.69 # Propositional solver time : 0.000
% 0.39/0.69 # Success case prop preproc time : 0.000
% 0.39/0.69 # Success case prop encoding time : 0.000
% 0.39/0.69 # Success case prop solver time : 0.000
% 0.39/0.69 # Current number of processed clauses : 311
% 0.39/0.69 # Positive orientable unit clauses : 84
% 0.39/0.69 # Positive unorientable unit clauses: 12
% 0.39/0.69 # Negative unit clauses : 13
% 0.39/0.69 # Non-unit-clauses : 202
% 0.39/0.69 # Current number of unprocessed clauses: 4749
% 0.39/0.69 # ...number of literals in the above : 10707
% 0.39/0.69 # Current number of archived formulas : 0
% 0.39/0.69 # Current number of archived clauses : 7
% 0.39/0.69 # Clause-clause subsumption calls (NU) : 2989
% 0.39/0.69 # Rec. Clause-clause subsumption calls : 2743
% 0.39/0.69 # Non-unit clause-clause subsumptions : 54
% 0.39/0.69 # Unit Clause-clause subsumption calls : 421
% 0.39/0.69 # Rewrite failures with RHS unbound : 0
% 0.39/0.69 # BW rewrite match attempts : 722
% 0.39/0.69 # BW rewrite match successes : 47
% 0.39/0.69 # Condensation attempts : 0
% 0.39/0.69 # Condensation successes : 0
% 0.39/0.69 # Termbank termtop insertions : 115655
% 0.39/0.69
% 0.39/0.69 # -------------------------------------------------
% 0.39/0.69 # User time : 0.101 s
% 0.39/0.69 # System time : 0.011 s
% 0.39/0.69 # Total time : 0.112 s
% 0.39/0.69 # Maximum resident set size: 2524 pages
% 0.39/0.69
% 0.39/0.69 # -------------------------------------------------
% 0.39/0.69 # User time : 0.118 s
% 0.39/0.69 # System time : 0.012 s
% 0.39/0.69 # Total time : 0.130 s
% 0.39/0.69 # Maximum resident set size: 2116 pages
% 0.39/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------