TSTP Solution File: SET731+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET731+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 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 19:20:23 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 78 ( 4 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 91 ( 33 ~; 29 |; 20 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 59 ( 0 sgn; 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII22,conjecture,
! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& subset(X11,X2)
& image2(X6,X1) = X11
& ! [X3,X5] :
( ( member(X3,X1)
& member(X5,X11) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) ) )
=> surjective(X10,X1,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.LwsUNQZy1N/E---3.1_20997.p',thII22) ).
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.LwsUNQZy1N/E---3.1_20997.p',surjective) ).
fof(image2,axiom,
! [X6,X1,X5] :
( member(X5,image2(X6,X1))
<=> ? [X3] :
( member(X3,X1)
& apply(X6,X3,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LwsUNQZy1N/E---3.1_20997.p',image2) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& subset(X11,X2)
& image2(X6,X1) = X11
& ! [X3,X5] :
( ( member(X3,X1)
& member(X5,X11) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) ) )
=> surjective(X10,X1,X11) ),
inference(assume_negation,[status(cth)],[thII22]) ).
fof(c_0_4,negated_conjecture,
! [X22,X23] :
( maps(esk1_0,esk3_0,esk4_0)
& subset(esk5_0,esk4_0)
& image2(esk1_0,esk3_0) = esk5_0
& ( ~ apply(esk2_0,X22,X23)
| apply(esk1_0,X22,X23)
| ~ member(X22,esk3_0)
| ~ member(X23,esk5_0) )
& ( ~ apply(esk1_0,X22,X23)
| apply(esk2_0,X22,X23)
| ~ member(X22,esk3_0)
| ~ member(X23,esk5_0) )
& ~ surjective(esk2_0,esk3_0,esk5_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,plain,
! [X24,X25,X26,X27,X29,X30,X31,X33] :
( ( member(esk6_4(X24,X25,X26,X27),X25)
| ~ member(X27,X26)
| ~ surjective(X24,X25,X26) )
& ( apply(X24,esk6_4(X24,X25,X26,X27),X27)
| ~ member(X27,X26)
| ~ surjective(X24,X25,X26) )
& ( member(esk7_3(X29,X30,X31),X31)
| surjective(X29,X30,X31) )
& ( ~ member(X33,X30)
| ~ apply(X29,X33,esk7_3(X29,X30,X31))
| surjective(X29,X30,X31) ) ),
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])])])])])]) ).
cnf(c_0_6,negated_conjecture,
~ surjective(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( surjective(X3,X2,X4)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk7_3(X3,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( member(esk7_3(X1,X2,X3),X3)
| surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ apply(esk2_0,X1,esk7_3(esk2_0,esk3_0,esk5_0))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( apply(esk2_0,X1,X2)
| ~ apply(esk1_0,X1,X2)
| ~ member(X1,esk3_0)
| ~ member(X2,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
member(esk7_3(esk2_0,esk3_0,esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
fof(c_0_12,plain,
! [X37,X38,X39,X41,X42,X43,X44] :
( ( member(esk8_3(X37,X38,X39),X38)
| ~ member(X39,image2(X37,X38)) )
& ( apply(X37,esk8_3(X37,X38,X39),X39)
| ~ member(X39,image2(X37,X38)) )
& ( ~ member(X44,X42)
| ~ apply(X41,X44,X43)
| member(X43,image2(X41,X42)) ) ),
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)],[image2])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ apply(esk1_0,X1,esk7_3(esk2_0,esk3_0,esk5_0))
| ~ member(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( apply(X1,esk8_3(X1,X2,X3),X3)
| ~ member(X3,image2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( member(esk8_3(X1,X2,X3),X2)
| ~ member(X3,image2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
image2(esk1_0,esk3_0) = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(esk8_3(esk1_0,X1,esk7_3(esk2_0,esk3_0,esk5_0)),esk3_0)
| ~ member(esk7_3(esk2_0,esk3_0,esk5_0),image2(esk1_0,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( member(esk8_3(esk1_0,esk3_0,X1),esk3_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]),c_0_11]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SET731+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 17:30:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.LwsUNQZy1N/E---3.1_20997.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_1 with pid 21077 completed with status 0
% 0.19/0.50 # Result found by new_bool_1
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.19/0.50 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.19/0.50 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 21079 completed with status 0
% 0.19/0.50 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.19/0.50 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.19/0.50 # Preprocessing time : 0.004 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 29
% 0.19/0.50 # Removed by relevancy pruning/SinE : 22
% 0.19/0.50 # Initial clauses : 41
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 41
% 0.19/0.50 # Processed clauses : 93
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 93
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 84
% 0.19/0.50 # ...of the previous two non-redundant : 81
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 84
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 4
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 52
% 0.19/0.50 # Positive orientable unit clauses : 4
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 2
% 0.19/0.50 # Non-unit-clauses : 46
% 0.19/0.50 # Current number of unprocessed clauses: 70
% 0.19/0.50 # ...number of literals in the above : 336
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 41
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 551
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 327
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 4
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 0
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 4683
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.009 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.013 s
% 0.19/0.50 # Maximum resident set size: 1908 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.010 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.015 s
% 0.19/0.50 # Maximum resident set size: 1744 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------