TSTP Solution File: SCT131+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SCT131+1 : TPTP v8.1.2. Released v5.2.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:17:32 EDT 2023
% Result : Theorem 4.13s 1.08s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 11 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 10 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-4 aty)
% Number of variables : 19 ( 1 sgn; 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_unanimity__def,axiom,
! [X26] :
( c_Arrow__Order__Mirabelle_Ounanimity(X26)
<=> ! [X3] :
( 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))),X3),c_Arrow__Order__Mirabelle_OProf))
=> ! [X33,X34] :
( ! [X13] : hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X33),X34)),hAPP(X3,X13)))
=> hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X33),X34)),hAPP(X26,X3))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p',fact_unanimity__def) ).
fof(fact__096_B_Bi_O_Ab_A_060_092_060_094bsub_062Q_Ai_092_060_094esub_062_Ab_H_096,axiom,
! [X4] : hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_Q____,X4))),
file('/export/starexec/sandbox2/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p',fact__096_B_Bi_O_Ab_A_060_092_060_094bsub_062Q_Ai_092_060_094esub_062_Ab_H_096) ).
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/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p',fact__096Q_A_058_AProf_096) ).
fof(conj_0,conjecture,
hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_F,v_Q____))),
file('/export/starexec/sandbox2/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p',conj_0) ).
fof(fact_u,axiom,
c_Arrow__Order__Mirabelle_Ounanimity(v_F),
file('/export/starexec/sandbox2/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p',fact_u) ).
fof(c_0_5,plain,
! [X1012,X1013,X1014,X1015,X1017,X1021] :
( ( ~ c_Arrow__Order__Mirabelle_Ounanimity(X1012)
| ~ 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))),X1013),c_Arrow__Order__Mirabelle_OProf))
| ~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1014),X1015)),hAPP(X1013,esk41_4(X1012,X1013,X1014,X1015))))
| hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1014),X1015)),hAPP(X1012,X1013))) )
& ( 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))),esk42_1(X1017)),c_Arrow__Order__Mirabelle_OProf))
| c_Arrow__Order__Mirabelle_Ounanimity(X1017) )
& ( hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),esk43_1(X1017)),esk44_1(X1017))),hAPP(esk42_1(X1017),X1021)))
| c_Arrow__Order__Mirabelle_Ounanimity(X1017) )
& ( ~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),esk43_1(X1017)),esk44_1(X1017))),hAPP(X1017,esk42_1(X1017))))
| c_Arrow__Order__Mirabelle_Ounanimity(X1017) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_unanimity__def])])])])])]) ).
fof(c_0_6,plain,
! [X392] : hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_Q____,X392))),
inference(variable_rename,[status(thm)],[fact__096_B_Bi_O_Ab_A_060_092_060_094bsub_062Q_Ai_092_060_094esub_062_Ab_H_096]) ).
cnf(c_0_7,plain,
( hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3),X4)),hAPP(X1,X2)))
| ~ c_Arrow__Order__Mirabelle_Ounanimity(X1)
| ~ 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))),X2),c_Arrow__Order__Mirabelle_OProf))
| ~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X3),X4)),hAPP(X2,esk41_4(X1,X2,X3,X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_Q____,X1))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,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_10,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_F,v_Q____))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
cnf(c_0_11,plain,
( hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(X1,v_Q____)))
| ~ c_Arrow__Order__Mirabelle_Ounanimity(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,plain,
c_Arrow__Order__Mirabelle_Ounanimity(v_F),
inference(split_conjunct,[status(thm)],[fact_u]) ).
cnf(c_0_13,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_F,v_Q____))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SCT131+1 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n002.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 11:58:59 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.5fLX6pEMUv/E---3.1_19487.p
% 4.13/1.08 # Version: 3.1pre001
% 4.13/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.13/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.13/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.13/1.08 # Starting new_bool_3 with 300s (1) cores
% 4.13/1.08 # Starting new_bool_1 with 300s (1) cores
% 4.13/1.08 # Starting sh5l with 300s (1) cores
% 4.13/1.08 # sh5l with pid 19569 completed with status 0
% 4.13/1.08 # Result found by sh5l
% 4.13/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.13/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.13/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.13/1.08 # Starting new_bool_3 with 300s (1) cores
% 4.13/1.08 # Starting new_bool_1 with 300s (1) cores
% 4.13/1.08 # Starting sh5l with 300s (1) cores
% 4.13/1.08 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.13/1.08 # Search class: FGHSM-FSLM33-DFFFFFNN
% 4.13/1.08 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 4.13/1.08 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 55s (1) cores
% 4.13/1.08 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with pid 19577 completed with status 0
% 4.13/1.08 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S
% 4.13/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.13/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.13/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.13/1.08 # Starting new_bool_3 with 300s (1) cores
% 4.13/1.08 # Starting new_bool_1 with 300s (1) cores
% 4.13/1.08 # Starting sh5l with 300s (1) cores
% 4.13/1.08 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.13/1.08 # Search class: FGHSM-FSLM33-DFFFFFNN
% 4.13/1.08 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 4.13/1.08 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 55s (1) cores
% 4.13/1.08 # Preprocessing time : 0.009 s
% 4.13/1.08 # Presaturation interreduction done
% 4.13/1.08
% 4.13/1.08 # Proof found!
% 4.13/1.08 # SZS status Theorem
% 4.13/1.08 # SZS output start CNFRefutation
% See solution above
% 4.13/1.08 # Parsed axioms : 535
% 4.13/1.08 # Removed by relevancy pruning/SinE : 66
% 4.13/1.08 # Initial clauses : 722
% 4.13/1.08 # Removed in clause preprocessing : 23
% 4.13/1.08 # Initial clauses in saturation : 699
% 4.13/1.08 # Processed clauses : 1379
% 4.13/1.08 # ...of these trivial : 4
% 4.13/1.08 # ...subsumed : 125
% 4.13/1.08 # ...remaining for further processing : 1250
% 4.13/1.08 # Other redundant clauses eliminated : 59
% 4.13/1.08 # Clauses deleted for lack of memory : 0
% 4.13/1.08 # Backward-subsumed : 1
% 4.13/1.08 # Backward-rewritten : 4
% 4.13/1.08 # Generated clauses : 9786
% 4.13/1.08 # ...of the previous two non-redundant : 9265
% 4.13/1.08 # ...aggressively subsumed : 0
% 4.13/1.08 # Contextual simplify-reflections : 0
% 4.13/1.08 # Paramodulations : 9715
% 4.13/1.08 # Factorizations : 0
% 4.13/1.08 # NegExts : 0
% 4.13/1.08 # Equation resolutions : 76
% 4.13/1.08 # Total rewrite steps : 1093
% 4.13/1.08 # Propositional unsat checks : 0
% 4.13/1.08 # Propositional check models : 0
% 4.13/1.08 # Propositional check unsatisfiable : 0
% 4.13/1.08 # Propositional clauses : 0
% 4.13/1.08 # Propositional clauses after purity: 0
% 4.13/1.08 # Propositional unsat core size : 0
% 4.13/1.08 # Propositional preprocessing time : 0.000
% 4.13/1.08 # Propositional encoding time : 0.000
% 4.13/1.08 # Propositional solver time : 0.000
% 4.13/1.08 # Success case prop preproc time : 0.000
% 4.13/1.08 # Success case prop encoding time : 0.000
% 4.13/1.08 # Success case prop solver time : 0.000
% 4.13/1.08 # Current number of processed clauses : 628
% 4.13/1.08 # Positive orientable unit clauses : 132
% 4.13/1.08 # Positive unorientable unit clauses: 8
% 4.13/1.08 # Negative unit clauses : 25
% 4.13/1.08 # Non-unit-clauses : 463
% 4.13/1.08 # Current number of unprocessed clauses: 9161
% 4.13/1.08 # ...number of literals in the above : 23576
% 4.13/1.08 # Current number of archived formulas : 0
% 4.13/1.08 # Current number of archived clauses : 581
% 4.13/1.08 # Clause-clause subsumption calls (NU) : 123733
% 4.13/1.08 # Rec. Clause-clause subsumption calls : 55953
% 4.13/1.08 # Non-unit clause-clause subsumptions : 104
% 4.13/1.08 # Unit Clause-clause subsumption calls : 4564
% 4.13/1.08 # Rewrite failures with RHS unbound : 3
% 4.13/1.08 # BW rewrite match attempts : 1312
% 4.13/1.08 # BW rewrite match successes : 81
% 4.13/1.08 # Condensation attempts : 0
% 4.13/1.08 # Condensation successes : 0
% 4.13/1.08 # Termbank termtop insertions : 405295
% 4.13/1.08
% 4.13/1.08 # -------------------------------------------------
% 4.13/1.08 # User time : 0.315 s
% 4.13/1.08 # System time : 0.019 s
% 4.13/1.08 # Total time : 0.334 s
% 4.13/1.08 # Maximum resident set size: 5752 pages
% 4.13/1.08
% 4.13/1.08 # -------------------------------------------------
% 4.13/1.08 # User time : 0.327 s
% 4.13/1.08 # System time : 0.022 s
% 4.13/1.08 # Total time : 0.349 s
% 4.13/1.08 # Maximum resident set size: 2536 pages
% 4.13/1.08 % E---3.1 exiting
%------------------------------------------------------------------------------