TSTP Solution File: COL092-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL092-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : Sat May 4 07:28:18 EDT 2024
% Result : Unsatisfiable 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 58 ( 11 unt; 7 nHn; 58 RR)
% Number of literals : 117 ( 28 equ; 54 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 110 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',k_app) ).
cnf(ap_parcontractE11,axiom,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE11) ).
cnf(k_parcontractE2,axiom,
( X1 = combK
| ~ member(pair(combK,X1),parcontract) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',k_parcontractE2) ).
cnf(ap_parcontractE12,axiom,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE12) ).
cnf(ap_parcontractE1,axiom,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE1) ).
cnf(k1_parcontractD_c1,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),parcontract) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',k1_parcontractD_c1) ).
cnf(ap_parcontractE13,axiom,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE13) ).
cnf(ap_parcontractE14,axiom,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE14) ).
cnf(ap_parcontractE3,axiom,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE3) ).
cnf(k1_parcontractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',k1_parcontractD_h1) ).
cnf(ap_parcontractE2,axiom,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE2) ).
cnf(ap_parcontractE6,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE6) ).
cnf(parcontract_intros1,axiom,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',parcontract_intros1) ).
cnf(ap_parcontractE4,axiom,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_parcontractE4) ).
cnf(ap_E2,axiom,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
file('/export/starexec/sandbox2/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p',ap_E2) ).
cnf(c_0_15,plain,
combK != comb_app(X1,X2),
inference(fof_simplification,[status(thm)],[k_app]) ).
cnf(c_0_16,plain,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE11]) ).
cnf(c_0_17,plain,
( X1 = combK
| ~ member(pair(combK,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[k_parcontractE2]) ).
cnf(c_0_18,plain,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE12]) ).
cnf(c_0_19,plain,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE1]) ).
cnf(c_0_20,plain,
combK != comb_app(X1,X2),
c_0_15 ).
cnf(c_0_21,plain,
( X1 = comb_app(comb_app(combS,ap_parcontractE_sk1p(X1,X2,X3)),ap_parcontractE_sk1q(X1,X2,X3))
| ~ ap_parcontractE_c3(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),parcontract) ),
inference(fof_simplification,[status(thm)],[k1_parcontractD_c1]) ).
cnf(c_0_23,plain,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE13]) ).
cnf(c_0_24,plain,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE14]) ).
cnf(c_0_25,plain,
( X1 = combK
| ~ member(pair(combK,X1),parcontract) ),
c_0_17 ).
cnf(c_0_26,plain,
( member(pair(X1,ap_parcontractE_sk2q(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_18 ).
cnf(c_0_27,plain,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE3]) ).
cnf(c_0_28,plain,
( ap_parcontractE_c1(X1,X2,X3)
| ap_parcontractE_c2(X1,X2,X3)
| ap_parcontractE_c3(X1,X2,X3)
| ap_parcontractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),parcontract) ),
c_0_19 ).
cnf(c_0_29,hypothesis,
member(pair(comb_app(combK,p),r),parcontract),
k1_parcontractD_h1 ).
cnf(c_0_30,plain,
~ ap_parcontractE_c3(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),parcontract) ),
c_0_22 ).
cnf(c_0_32,plain,
( member(pair(X2,ap_parcontractE_sk2s(X1,X2,X3)),parcontract)
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_33,plain,
( X3 = comb_app(ap_parcontractE_sk2q(X1,X2,X3),ap_parcontractE_sk2s(X1,X2,X3))
| ~ ap_parcontractE_c4(X1,X2,X3) ),
c_0_24 ).
cnf(c_0_34,plain,
( ap_parcontractE_sk2q(combK,X1,X2) = combK
| ~ ap_parcontractE_c4(combK,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( X3 = comb_app(X1,X2)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
c_0_27 ).
cnf(c_0_36,hypothesis,
( ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r)
| ap_parcontractE_c1(combK,p,r) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( comb_app(combK,ap_parcontractE_sk2s(X1,p,X2)) != r
| ~ ap_parcontractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( comb_app(combK,ap_parcontractE_sk2s(combK,X1,X2)) = X2
| ~ ap_parcontractE_c4(combK,X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE2]) ).
cnf(c_0_40,plain,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE6]) ).
cnf(c_0_41,hypothesis,
( comb_app(combK,p) = r
| ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ ap_parcontractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_43,plain,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
inference(fof_simplification,[status(thm)],[parcontract_intros1]) ).
cnf(c_0_44,plain,
( member(comb_app(X1,X2),comb)
| ~ ap_parcontractE_c1(X1,X2,X3) ),
c_0_39 ).
cnf(c_0_45,plain,
( X1 = comb_app(combK,X3)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
c_0_40 ).
cnf(c_0_46,hypothesis,
( comb_app(combK,p) = r
| ap_parcontractE_c2(combK,p,r) ),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[ap_parcontractE4]) ).
cnf(c_0_48,plain,
( member(pair(X1,X1),parcontract)
| ~ member(X1,comb) ),
c_0_43 ).
cnf(c_0_49,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
inference(fof_simplification,[status(thm)],[ap_E2]) ).
cnf(c_0_50,hypothesis,
( ap_parcontractE_c4(combK,p,r)
| ap_parcontractE_c2(combK,p,r)
| member(comb_app(combK,p),comb) ),
inference(spm,[status(thm)],[c_0_44,c_0_36]) ).
cnf(c_0_51,hypothesis,
comb_app(combK,p) = r,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20]) ).
cnf(c_0_52,plain,
( member(X3,comb)
| ~ ap_parcontractE_c2(X1,X2,X3) ),
c_0_47 ).
cnf(c_0_53,negated_conjecture,
( comb_app(combK,p) != r
| ~ member(p,comb) ),
inference(spm,[status(thm)],[c_0_31,c_0_48]) ).
cnf(c_0_54,plain,
( member(X2,comb)
| ~ member(comb_app(X1,X2),comb) ),
c_0_49 ).
cnf(c_0_55,hypothesis,
member(r,comb),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_50,c_0_42]),c_0_51]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
~ member(p,comb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_51])]) ).
cnf(c_0_57,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COL092-1 : TPTP v8.1.2. Released v2.7.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 12:00:03 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.47 Running first-order theorem proving
% 0.17/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/tmp/tmp.Ej3WsMHGZm/E---3.1_14526.p
% 0.17/0.51 # Version: 3.1.0
% 0.17/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # sh5l with pid 14647 completed with status 0
% 0.17/0.51 # Result found by sh5l
% 0.17/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.51 # Search class: FGHSF-FFMS32-MFFFFFNN
% 0.17/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.51 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.51 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14654 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.51 # Search class: FGHSF-FFMS32-MFFFFFNN
% 0.17/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.51 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.51 # Preprocessing time : 0.002 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Unsatisfiable
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 55
% 0.17/0.51 # Removed by relevancy pruning/SinE : 1
% 0.17/0.51 # Initial clauses : 54
% 0.17/0.51 # Removed in clause preprocessing : 1
% 0.17/0.51 # Initial clauses in saturation : 53
% 0.17/0.51 # Processed clauses : 181
% 0.17/0.51 # ...of these trivial : 4
% 0.17/0.51 # ...subsumed : 10
% 0.17/0.51 # ...remaining for further processing : 166
% 0.17/0.51 # Other redundant clauses eliminated : 63
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 2
% 0.17/0.51 # Backward-rewritten : 4
% 0.17/0.51 # Generated clauses : 354
% 0.17/0.51 # ...of the previous two non-redundant : 286
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 2
% 0.17/0.51 # Paramodulations : 286
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 65
% 0.17/0.51 # Disequality decompositions : 0
% 0.17/0.51 # Total rewrite steps : 28
% 0.17/0.51 # ...of those cached : 24
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 106
% 0.17/0.51 # Positive orientable unit clauses : 6
% 0.17/0.51 # Positive unorientable unit clauses: 0
% 0.17/0.51 # Negative unit clauses : 30
% 0.17/0.51 # Non-unit-clauses : 70
% 0.17/0.51 # Current number of unprocessed clauses: 203
% 0.17/0.51 # ...number of literals in the above : 770
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 60
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 1145
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 876
% 0.17/0.51 # Non-unit clause-clause subsumptions : 10
% 0.17/0.51 # Unit Clause-clause subsumption calls : 390
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 1
% 0.17/0.51 # BW rewrite match successes : 1
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 6422
% 0.17/0.51 # Search garbage collected termcells : 103
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.021 s
% 0.17/0.51 # System time : 0.002 s
% 0.17/0.51 # Total time : 0.023 s
% 0.17/0.51 # Maximum resident set size: 1824 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.023 s
% 0.17/0.51 # System time : 0.005 s
% 0.17/0.51 # Total time : 0.029 s
% 0.17/0.51 # Maximum resident set size: 1736 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E exiting
%------------------------------------------------------------------------------