TSTP Solution File: SWW360+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW360+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:09:13 EDT 2023
% Result : Theorem 5.73s 3.62s
% Output : CNFRefutation 5.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 44 ( 2 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 11 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 42 ( 1 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_2,conjecture,
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X3),v_U))
=> v_P(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,X3)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))) ),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',conj_2) ).
fof(conj_1,hypothesis,
v_G = hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',conj_1) ).
fof(fact_assms_I1_J,axiom,
! [X10,X13] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),X13),X10))
=> v_P(X10,X13) ),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',fact_assms_I1_J) ).
fof(fact_insert__subset,axiom,
! [X12,X9,X18,X7] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X7,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X7),X18),X9)),X12))
<=> ( hBOOL(hAPP(hAPP(c_member(X7),X18),X12))
& hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X7,tc_HOL_Obool)),X9),X12)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',fact_insert__subset) ).
fof(fact_empty__subsetI,axiom,
! [X9,X7] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X7,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X7,tc_HOL_Obool))),X9)),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',fact_empty__subsetI) ).
fof(fact_imageI,axiom,
! [X2,X5,X9,X18,X7] :
( hBOOL(hAPP(hAPP(c_member(X7),X18),X9))
=> hBOOL(hAPP(hAPP(c_member(X5),hAPP(X2,X18)),hAPP(c_Set_Oimage(X7,X5,X2),X9))) ),
file('/export/starexec/sandbox2/tmp/tmp.KiraJwMIqc/E---3.1_16836.p',fact_imageI) ).
fof(c_0_6,negated_conjecture,
~ ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X3),v_U))
=> v_P(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,X3)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))) ),
inference(assume_negation,[status(cth)],[conj_2]) ).
fof(c_0_7,negated_conjecture,
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),esk1_0),v_U))
& ~ v_P(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,esk1_0)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_8,negated_conjecture,
~ v_P(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,esk1_0)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,hypothesis,
v_G = hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),
inference(split_conjunct,[status(thm)],[conj_1]) ).
fof(c_0_10,plain,
! [X472,X473] :
( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),X473),X472))
| v_P(X472,X473) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_assms_I1_J])]) ).
cnf(c_0_11,negated_conjecture,
~ v_P(v_G,hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,esk1_0)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( v_P(X2,X1)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X606,X607,X608,X609] :
( ( hBOOL(hAPP(hAPP(c_member(X609),X608),X606))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X609,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X609),X608),X607)),X606)) )
& ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X609,tc_HOL_Obool)),X607),X606))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X609,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X609),X608),X607)),X606)) )
& ( ~ hBOOL(hAPP(hAPP(c_member(X609),X608),X606))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X609,tc_HOL_Obool)),X607),X606))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X609,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X609),X608),X607)),X606)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_insert__subset])])]) ).
fof(c_0_14,plain,
! [X474,X475] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X475,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X475,tc_HOL_Obool))),X474)),
inference(variable_rename,[status(thm)],[fact_empty__subsetI]) ).
fof(c_0_15,plain,
! [X411,X412,X413,X414,X415] :
( ~ hBOOL(hAPP(hAPP(c_member(X415),X414),X413))
| hBOOL(hAPP(hAPP(c_member(X412),hAPP(X411,X414)),hAPP(c_Set_Oimage(X415,X412,X411),X413))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_imageI])]) ).
cnf(c_0_16,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,esk1_0)),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_HOL_Obool)))),v_G)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4)),X3))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X4),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),X2)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( hBOOL(hAPP(hAPP(c_member(X4),hAPP(X5,X2)),hAPP(c_Set_Oimage(X1,X4,X5),X3)))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,esk1_0)),v_G)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
( hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,X1)),v_G))
| ~ hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X1),v_U)) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),esk1_0),v_U)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.95/1.02 % Problem : SWW360+1 : TPTP v8.1.2. Released v5.2.0.
% 0.95/1.03 % Command : run_E %s %d THM
% 1.02/1.23 % Computer : n011.cluster.edu
% 1.02/1.23 % Model : x86_64 x86_64
% 1.02/1.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.02/1.23 % Memory : 8042.1875MB
% 1.02/1.23 % OS : Linux 3.10.0-693.el7.x86_64
% 1.02/1.23 % CPULimit : 2400
% 1.02/1.23 % WCLimit : 300
% 1.02/1.23 % DateTime : Mon Oct 2 22:22:39 EDT 2023
% 1.02/1.23 % CPUTime :
% 2.24/2.45 Running first-order theorem proving
% 2.24/2.45 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.KiraJwMIqc/E---3.1_16836.p
% 5.73/3.62 # Version: 3.1pre001
% 5.73/3.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.73/3.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.73/3.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.73/3.62 # Starting new_bool_3 with 300s (1) cores
% 5.73/3.62 # Starting new_bool_1 with 300s (1) cores
% 5.73/3.62 # Starting sh5l with 300s (1) cores
% 5.73/3.62 # new_bool_1 with pid 16916 completed with status 0
% 5.73/3.62 # Result found by new_bool_1
% 5.73/3.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.73/3.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.73/3.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.73/3.62 # Starting new_bool_3 with 300s (1) cores
% 5.73/3.62 # Starting new_bool_1 with 300s (1) cores
% 5.73/3.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.73/3.62 # Search class: FGHSM-FSLM32-DFFFFFNN
% 5.73/3.62 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 5.73/3.62 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 5.73/3.62 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 16918 completed with status 0
% 5.73/3.62 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 5.73/3.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.73/3.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.73/3.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.73/3.62 # Starting new_bool_3 with 300s (1) cores
% 5.73/3.62 # Starting new_bool_1 with 300s (1) cores
% 5.73/3.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.73/3.62 # Search class: FGHSM-FSLM32-DFFFFFNN
% 5.73/3.62 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 5.73/3.62 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 5.73/3.62 # Preprocessing time : 0.041 s
% 5.73/3.62
% 5.73/3.62 # Proof found!
% 5.73/3.62 # SZS status Theorem
% 5.73/3.62 # SZS output start CNFRefutation
% See solution above
% 5.73/3.62 # Parsed axioms : 5226
% 5.73/3.62 # Removed by relevancy pruning/SinE : 4589
% 5.73/3.62 # Initial clauses : 984
% 5.73/3.62 # Removed in clause preprocessing : 36
% 5.73/3.62 # Initial clauses in saturation : 948
% 5.73/3.62 # Processed clauses : 1100
% 5.73/3.62 # ...of these trivial : 45
% 5.73/3.62 # ...subsumed : 218
% 5.73/3.62 # ...remaining for further processing : 837
% 5.73/3.62 # Other redundant clauses eliminated : 217
% 5.73/3.62 # Clauses deleted for lack of memory : 0
% 5.73/3.62 # Backward-subsumed : 8
% 5.73/3.62 # Backward-rewritten : 16
% 5.73/3.62 # Generated clauses : 22491
% 5.73/3.62 # ...of the previous two non-redundant : 20243
% 5.73/3.62 # ...aggressively subsumed : 0
% 5.73/3.62 # Contextual simplify-reflections : 5
% 5.73/3.62 # Paramodulations : 22233
% 5.73/3.62 # Factorizations : 8
% 5.73/3.62 # NegExts : 0
% 5.73/3.62 # Equation resolutions : 251
% 5.73/3.62 # Total rewrite steps : 7545
% 5.73/3.62 # Propositional unsat checks : 0
% 5.73/3.62 # Propositional check models : 0
% 5.73/3.62 # Propositional check unsatisfiable : 0
% 5.73/3.62 # Propositional clauses : 0
% 5.73/3.62 # Propositional clauses after purity: 0
% 5.73/3.62 # Propositional unsat core size : 0
% 5.73/3.62 # Propositional preprocessing time : 0.000
% 5.73/3.62 # Propositional encoding time : 0.000
% 5.73/3.62 # Propositional solver time : 0.000
% 5.73/3.62 # Success case prop preproc time : 0.000
% 5.73/3.62 # Success case prop encoding time : 0.000
% 5.73/3.62 # Success case prop solver time : 0.000
% 5.73/3.62 # Current number of processed clauses : 789
% 5.73/3.62 # Positive orientable unit clauses : 187
% 5.73/3.62 # Positive unorientable unit clauses: 19
% 5.73/3.62 # Negative unit clauses : 29
% 5.73/3.62 # Non-unit-clauses : 554
% 5.73/3.62 # Current number of unprocessed clauses: 20009
% 5.73/3.62 # ...number of literals in the above : 60060
% 5.73/3.62 # Current number of archived formulas : 0
% 5.73/3.62 # Current number of archived clauses : 24
% 5.73/3.62 # Clause-clause subsumption calls (NU) : 40680
% 5.73/3.62 # Rec. Clause-clause subsumption calls : 24622
% 5.73/3.62 # Non-unit clause-clause subsumptions : 163
% 5.73/3.62 # Unit Clause-clause subsumption calls : 3809
% 5.73/3.62 # Rewrite failures with RHS unbound : 23
% 5.73/3.62 # BW rewrite match attempts : 2727
% 5.73/3.62 # BW rewrite match successes : 93
% 5.73/3.62 # Condensation attempts : 0
% 5.73/3.62 # Condensation successes : 0
% 5.73/3.62 # Termbank termtop insertions : 913708
% 5.73/3.62
% 5.73/3.62 # -------------------------------------------------
% 5.73/3.62 # User time : 0.846 s
% 5.73/3.62 # System time : 0.038 s
% 5.73/3.62 # Total time : 0.884 s
% 5.73/3.62 # Maximum resident set size: 11428 pages
% 5.73/3.62
% 5.73/3.62 # -------------------------------------------------
% 5.73/3.62 # User time : 1.088 s
% 5.73/3.62 # System time : 0.053 s
% 5.73/3.62 # Total time : 1.141 s
% 5.73/3.62 # Maximum resident set size: 9460 pages
% 5.73/3.62 % E---3.1 exiting
% 6.10/3.62 % E---3.1 exiting
%------------------------------------------------------------------------------