TSTP Solution File: SET722+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET722+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 09:20:02 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 104 ( 42 ~; 39 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-7 aty)
% Number of variables : 73 ( 0 sgn 37 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII13,conjecture,
! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) )
=> surjective(X10,X2,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.Npwx0HTZyH/E---3.1_27980.p',thII13) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X6,X4,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Npwx0HTZyH/E---3.1_27980.p',surjective) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Npwx0HTZyH/E---3.1_27980.p',compose_function) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) )
=> surjective(X10,X2,X11) ),
inference(assume_negation,[status(cth)],[thII13]) ).
fof(c_0_4,plain,
! [X22,X23,X24,X25,X27,X28,X29,X31] :
( ( member(esk6_4(X22,X23,X24,X25),X23)
| ~ member(X25,X24)
| ~ surjective(X22,X23,X24) )
& ( apply(X22,esk6_4(X22,X23,X24,X25),X25)
| ~ member(X25,X24)
| ~ surjective(X22,X23,X24) )
& ( member(esk7_3(X27,X28,X29),X29)
| surjective(X27,X28,X29) )
& ( ~ member(X31,X28)
| ~ apply(X27,X31,esk7_3(X27,X28,X29))
| surjective(X27,X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[surjective])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( maps(esk1_0,esk3_0,esk4_0)
& maps(esk2_0,esk4_0,esk5_0)
& surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)
& ~ surjective(esk2_0,esk4_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X35,X36,X37,X38,X39,X40,X41,X43] :
( ( member(esk8_7(X35,X36,X37,X38,X39,X40,X41),X38)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( apply(X36,X40,esk8_7(X35,X36,X37,X38,X39,X40,X41))
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( apply(X35,esk8_7(X35,X36,X37,X38,X39,X40,X41),X41)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( ~ member(X43,X38)
| ~ apply(X36,X40,X43)
| ~ apply(X35,X43,X41)
| apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])])]) ).
cnf(c_0_7,plain,
( apply(X1,esk6_4(X1,X2,X3,X4),X4)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(esk6_4(X1,X2,X3,X4),X2)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ surjective(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( surjective(X3,X2,X4)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk7_3(X3,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( apply(X1,esk8_7(X1,X2,X3,X4,X5,X6,X7),X7)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk6_4(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0,X1),X1)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( member(esk6_4(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0,X1),esk3_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_15,plain,
( member(esk7_3(X1,X2,X3),X3)
| surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( ~ apply(esk2_0,X1,esk7_3(esk2_0,esk4_0,esk5_0))
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk2_0,esk8_7(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0,esk6_4(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0,X1),X1),X1)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
member(esk7_3(esk2_0,esk4_0,esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_19,plain,
( member(esk8_7(X1,X2,X3,X4,X5,X6,X7),X4)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
~ member(esk8_7(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0,esk6_4(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0,esk7_3(esk2_0,esk4_0,esk5_0)),esk7_3(esk2_0,esk4_0,esk5_0)),esk4_0),
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,negated_conjecture,
( member(esk8_7(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0,esk6_4(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0,X1),X1),esk4_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_14]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET722+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n020.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 10:09:16 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.Npwx0HTZyH/E---3.1_27980.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 28059 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.15/0.43 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.15/0.43 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 28063 completed with status 0
% 0.15/0.43 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.15/0.43 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.15/0.43 # Preprocessing time : 0.003 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 29
% 0.15/0.43 # Removed by relevancy pruning/SinE : 23
% 0.15/0.43 # Initial clauses : 37
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 37
% 0.15/0.43 # Processed clauses : 143
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 9
% 0.15/0.43 # ...remaining for further processing : 134
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 324
% 0.15/0.43 # ...of the previous two non-redundant : 312
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 4
% 0.15/0.43 # Paramodulations : 324
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 9
% 0.15/0.43 # ...of those cached : 8
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 97
% 0.15/0.43 # Positive orientable unit clauses : 4
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 3
% 0.15/0.43 # Non-unit-clauses : 90
% 0.15/0.43 # Current number of unprocessed clauses: 243
% 0.15/0.43 # ...number of literals in the above : 1645
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 37
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 2411
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 1099
% 0.15/0.43 # Non-unit clause-clause subsumptions : 13
% 0.15/0.43 # Unit Clause-clause subsumption calls : 21
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 11788
% 0.15/0.43 # Search garbage collected termcells : 1048
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.014 s
% 0.15/0.43 # System time : 0.004 s
% 0.15/0.43 # Total time : 0.018 s
% 0.15/0.43 # Maximum resident set size: 1896 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.015 s
% 0.15/0.43 # System time : 0.006 s
% 0.15/0.43 # Total time : 0.021 s
% 0.15/0.43 # Maximum resident set size: 1756 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------