TSTP Solution File: SCT126+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SCT126+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : 600s
% DateTime : Mon Jul 18 21:23:18 EDT 2022
% Result : Theorem 0.26s 1.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 9 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 35 ( 6 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_mem__def,axiom,
! [X9,X4,X7] :
( hBOOL(hAPP(hAPP(c_member(X7),X4),X9))
<=> hBOOL(hAPP(X9,X4)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_mem__def) ).
fof(fact_funcset__mem,axiom,
! [X4,X8,X9,X2,X19,X7] :
( hBOOL(hAPP(hAPP(c_member(tc_fun(X7,X19)),X2),c_FuncSet_OPi(X7,X19,X9,c_COMBK(tc_fun(X19,tc_HOL_Obool),X7,X8))))
=> ( hBOOL(hAPP(hAPP(c_member(X7),X4),X9))
=> hBOOL(hAPP(hAPP(c_member(X19),hAPP(X2,X4)),X8)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_funcset__mem) ).
fof(fact__096Q_A_058_AProf_096,axiom,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact__096Q_A_058_AProf_096) ).
fof(conj_0,conjecture,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).
fof(fact_assms_I1_J,axiom,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_F),c_FuncSet_OPi(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),c_Arrow__Order__Mirabelle_OProf,c_COMBK(tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_HOL_Obool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),c_Arrow__Order__Mirabelle_OLin)))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_assms_I1_J) ).
fof(c_0_5,plain,
! [X10,X11,X12,X10,X11,X12] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X12),X11),X10))
| hBOOL(hAPP(X10,X11)) )
& ( ~ hBOOL(hAPP(X10,X11))
| hBOOL(hAPP(hAPP(c_member(X12),X11),X10)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])])])]) ).
fof(c_0_6,plain,
! [X20,X21,X22,X23,X24,X25] :
( ~ hBOOL(hAPP(hAPP(c_member(tc_fun(X25,X24)),X23),c_FuncSet_OPi(X25,X24,X22,c_COMBK(tc_fun(X24,tc_HOL_Obool),X25,X21))))
| ~ hBOOL(hAPP(hAPP(c_member(X25),X20),X22))
| hBOOL(hAPP(hAPP(c_member(X24),hAPP(X23,X20)),X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_funcset__mem])]) ).
cnf(c_0_7,plain,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_member(X3),X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
inference(split_conjunct,[status(thm)],[fact__096Q_A_058_AProf_096]) ).
fof(c_0_9,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
inference(assume_negation,[status(cth)],[conj_0]) ).
cnf(c_0_10,plain,
( hBOOL(hAPP(hAPP(c_member(X1),hAPP(X2,X3)),X4))
| ~ hBOOL(hAPP(hAPP(c_member(X5),X3),X6))
| ~ hBOOL(hAPP(hAPP(c_member(tc_fun(X5,X1)),X2),c_FuncSet_OPi(X5,X1,X6,c_COMBK(tc_fun(X1,tc_HOL_Obool),X5,X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_F),c_FuncSet_OPi(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),c_Arrow__Order__Mirabelle_OProf,c_COMBK(tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_HOL_Obool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),c_Arrow__Order__Mirabelle_OLin)))),
inference(split_conjunct,[status(thm)],[fact_assms_I1_J]) ).
cnf(c_0_12,plain,
( hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| ~ hBOOL(hAPP(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,v_Q____)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_14,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),hAPP(v_F,X1)),c_Arrow__Order__Mirabelle_OLin))
| ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),X1),c_Arrow__Order__Mirabelle_OProf)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
hBOOL(hAPP(hAPP(c_member(X1),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),hAPP(v_F,v_Q____)),c_Arrow__Order__Mirabelle_OLin)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SCT126+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n007.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 1 23:17:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.26/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.45 # Preprocessing time : 0.049 s
% 0.26/1.45
% 0.26/1.45 # Proof found!
% 0.26/1.45 # SZS status Theorem
% 0.26/1.45 # SZS output start CNFRefutation
% See solution above
% 0.26/1.45 # Proof object total steps : 19
% 0.26/1.45 # Proof object clause steps : 10
% 0.26/1.45 # Proof object formula steps : 9
% 0.26/1.45 # Proof object conjectures : 4
% 0.26/1.45 # Proof object clause conjectures : 1
% 0.26/1.45 # Proof object formula conjectures : 3
% 0.26/1.45 # Proof object initial clauses used : 6
% 0.26/1.45 # Proof object initial formulas used : 5
% 0.26/1.45 # Proof object generating inferences : 4
% 0.26/1.45 # Proof object simplifying inferences : 1
% 0.26/1.45 # Training examples: 0 positive, 0 negative
% 0.26/1.45 # Parsed axioms : 525
% 0.26/1.45 # Removed by relevancy pruning/SinE : 424
% 0.26/1.45 # Initial clauses : 150
% 0.26/1.45 # Removed in clause preprocessing : 11
% 0.26/1.45 # Initial clauses in saturation : 139
% 0.26/1.45 # Processed clauses : 154
% 0.26/1.45 # ...of these trivial : 3
% 0.26/1.45 # ...subsumed : 18
% 0.26/1.45 # ...remaining for further processing : 133
% 0.26/1.45 # Other redundant clauses eliminated : 1
% 0.26/1.45 # Clauses deleted for lack of memory : 0
% 0.26/1.45 # Backward-subsumed : 0
% 0.26/1.45 # Backward-rewritten : 3
% 0.26/1.45 # Generated clauses : 1047
% 0.26/1.45 # ...of the previous two non-trivial : 958
% 0.26/1.45 # Contextual simplify-reflections : 2
% 0.26/1.45 # Paramodulations : 1043
% 0.26/1.45 # Factorizations : 0
% 0.26/1.45 # Equation resolutions : 4
% 0.26/1.45 # Current number of processed clauses : 129
% 0.26/1.45 # Positive orientable unit clauses : 22
% 0.26/1.45 # Positive unorientable unit clauses: 2
% 0.26/1.45 # Negative unit clauses : 5
% 0.26/1.45 # Non-unit-clauses : 100
% 0.26/1.45 # Current number of unprocessed clauses: 933
% 0.26/1.45 # ...number of literals in the above : 3031
% 0.26/1.45 # Current number of archived formulas : 0
% 0.26/1.45 # Current number of archived clauses : 3
% 0.26/1.45 # Clause-clause subsumption calls (NU) : 3669
% 0.26/1.45 # Rec. Clause-clause subsumption calls : 2918
% 0.26/1.45 # Non-unit clause-clause subsumptions : 18
% 0.26/1.45 # Unit Clause-clause subsumption calls : 106
% 0.26/1.45 # Rewrite failures with RHS unbound : 0
% 0.26/1.45 # BW rewrite match attempts : 66
% 0.26/1.45 # BW rewrite match successes : 7
% 0.26/1.45 # Condensation attempts : 0
% 0.26/1.45 # Condensation successes : 0
% 0.26/1.45 # Termbank termtop insertions : 64417
% 0.26/1.45
% 0.26/1.45 # -------------------------------------------------
% 0.26/1.45 # User time : 0.098 s
% 0.26/1.45 # System time : 0.009 s
% 0.26/1.45 # Total time : 0.107 s
% 0.26/1.45 # Maximum resident set size: 5824 pages
%------------------------------------------------------------------------------