TSTP Solution File: SET734+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET734+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:23:30 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 109 ( 42 ~; 40 |; 19 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-7 aty)
% Number of variables : 73 ( 0 sgn; 43 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII25,conjecture,
! [X6,X10,X1,X2] :
( ( maps(X10,X1,X2)
& maps(X6,X2,X1)
& identity(compose_function(X10,X6,X2,X1,X2),X2) )
=> surjective(X10,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.M1GBXfPa1k/E---3.1_4850.p',thII25) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.M1GBXfPa1k/E---3.1_4850.p',identity) ).
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/sandbox/tmp/tmp.M1GBXfPa1k/E---3.1_4850.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/sandbox/tmp/tmp.M1GBXfPa1k/E---3.1_4850.p',compose_function) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X10,X1,X2] :
( ( maps(X10,X1,X2)
& maps(X6,X2,X1)
& identity(compose_function(X10,X6,X2,X1,X2),X2) )
=> surjective(X10,X1,X2) ),
inference(assume_negation,[status(cth)],[thII25]) ).
fof(c_0_5,plain,
! [X34,X35,X36,X37,X38] :
( ( ~ identity(X34,X35)
| ~ member(X36,X35)
| apply(X34,X36,X36) )
& ( member(esk7_2(X37,X38),X38)
| identity(X37,X38) )
& ( ~ apply(X37,esk7_2(X37,X38),esk7_2(X37,X38))
| identity(X37,X38) ) ),
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)],[identity])])])])])]) ).
fof(c_0_6,negated_conjecture,
( maps(esk2_0,esk3_0,esk4_0)
& maps(esk1_0,esk4_0,esk3_0)
& identity(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),esk4_0)
& ~ surjective(esk2_0,esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X21,X22,X23,X24,X26,X27,X28,X30] :
( ( member(esk5_4(X21,X22,X23,X24),X22)
| ~ member(X24,X23)
| ~ surjective(X21,X22,X23) )
& ( apply(X21,esk5_4(X21,X22,X23,X24),X24)
| ~ member(X24,X23)
| ~ surjective(X21,X22,X23) )
& ( member(esk6_3(X26,X27,X28),X28)
| surjective(X26,X27,X28) )
& ( ~ member(X30,X27)
| ~ apply(X26,X30,esk6_3(X26,X27,X28))
| surjective(X26,X27,X28) ) ),
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)],[surjective])])])])])]) ).
fof(c_0_8,plain,
! [X40,X41,X42,X43,X44,X45,X46,X48] :
( ( member(esk8_7(X40,X41,X42,X43,X44,X45,X46),X43)
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| ~ member(X45,X42)
| ~ member(X46,X44) )
& ( apply(X41,X45,esk8_7(X40,X41,X42,X43,X44,X45,X46))
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| ~ member(X45,X42)
| ~ member(X46,X44) )
& ( apply(X40,esk8_7(X40,X41,X42,X43,X44,X45,X46),X46)
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| ~ member(X45,X42)
| ~ member(X46,X44) )
& ( ~ member(X48,X43)
| ~ apply(X41,X45,X48)
| ~ apply(X40,X48,X46)
| apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| ~ member(X45,X42)
| ~ member(X46,X44) ) ),
inference(distribute,[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_9,plain,
( apply(X1,X3,X3)
| ~ identity(X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
identity(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ surjective(esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( surjective(X3,X2,X4)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk6_3(X3,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,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_8]) ).
cnf(c_0_14,negated_conjecture,
( apply(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),X1,X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( member(esk6_3(X1,X2,X3),X3)
| surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( ~ apply(esk2_0,X1,esk6_3(esk2_0,esk3_0,esk4_0))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk2_0,esk8_7(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0,X1,X1),X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
member(esk6_3(esk2_0,esk3_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_11,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_8]) ).
cnf(c_0_20,negated_conjecture,
~ member(esk8_7(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0,esk6_3(esk2_0,esk3_0,esk4_0),esk6_3(esk2_0,esk3_0,esk4_0)),esk3_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,esk4_0,esk3_0,esk4_0,X1,X1),esk3_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,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.00/0.10 % Problem : SET734+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n019.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 16:32:21 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.M1GBXfPa1k/E---3.1_4850.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_3 with pid 4929 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.16/0.44 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.16/0.44 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 4933 completed with status 0
% 0.16/0.44 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.16/0.44 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.16/0.44 # Preprocessing time : 0.002 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 29
% 0.16/0.44 # Removed by relevancy pruning/SinE : 22
% 0.16/0.44 # Initial clauses : 40
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 40
% 0.16/0.44 # Processed clauses : 101
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 1
% 0.16/0.44 # ...remaining for further processing : 100
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 88
% 0.16/0.44 # ...of the previous two non-redundant : 83
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 88
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 3
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 60
% 0.16/0.44 # Positive orientable unit clauses : 4
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 3
% 0.16/0.44 # Non-unit-clauses : 53
% 0.16/0.44 # Current number of unprocessed clauses: 62
% 0.16/0.44 # ...number of literals in the above : 352
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 40
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 847
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 515
% 0.16/0.44 # Non-unit clause-clause subsumptions : 1
% 0.16/0.44 # Unit Clause-clause subsumption calls : 28
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 4810
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.009 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.012 s
% 0.16/0.44 # Maximum resident set size: 1880 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.011 s
% 0.16/0.44 # System time : 0.005 s
% 0.16/0.44 # Total time : 0.016 s
% 0.16/0.44 # Maximum resident set size: 1736 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------