TSTP Solution File: SET764+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET764+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:34 EDT 2023
% Result : Theorem 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 57 ( 25 ~; 17 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 45 ( 6 sgn; 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIIa14,conjecture,
! [X6,X1,X2] :
( maps(X6,X1,X2)
=> equal_set(inverse_image2(X6,empty_set),empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.yoeXRdydFH/E---3.1_29172.p',thIIa14) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/tmp/tmp.yoeXRdydFH/E---3.1_29172.p',empty_set) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.yoeXRdydFH/E---3.1_29172.p',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.yoeXRdydFH/E---3.1_29172.p',subset) ).
fof(inverse_image2,axiom,
! [X6,X2,X3] :
( member(X3,inverse_image2(X6,X2))
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.yoeXRdydFH/E---3.1_29172.p',inverse_image2) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X1,X2] :
( maps(X6,X1,X2)
=> equal_set(inverse_image2(X6,empty_set),empty_set) ),
inference(assume_negation,[status(cth)],[thIIa14]) ).
fof(c_0_6,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[empty_set]) ).
fof(c_0_7,negated_conjecture,
( maps(esk1_0,esk2_0,esk3_0)
& ~ equal_set(inverse_image2(esk1_0,empty_set),empty_set) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X20,X21] :
( ( subset(X20,X21)
| ~ equal_set(X20,X21) )
& ( subset(X21,X20)
| ~ equal_set(X20,X21) )
& ( ~ subset(X20,X21)
| ~ subset(X21,X20)
| equal_set(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
fof(c_0_9,plain,
! [X22] : ~ member(X22,empty_set),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X47,X48,X49,X50,X51] :
( ( ~ subset(X47,X48)
| ~ member(X49,X47)
| member(X49,X48) )
& ( member(esk10_2(X50,X51),X50)
| subset(X50,X51) )
& ( ~ member(esk10_2(X50,X51),X51)
| subset(X50,X51) ) ),
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)],[subset])])])])])]) ).
fof(c_0_11,plain,
! [X23,X24,X25,X27,X28,X29,X30] :
( ( member(esk4_3(X23,X24,X25),X24)
| ~ member(X25,inverse_image2(X23,X24)) )
& ( apply(X23,X25,esk4_3(X23,X24,X25))
| ~ member(X25,inverse_image2(X23,X24)) )
& ( ~ member(X30,X28)
| ~ apply(X27,X29,X30)
| member(X29,inverse_image2(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)],[inverse_image2])])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ equal_set(inverse_image2(esk1_0,empty_set),empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( member(esk10_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( member(esk4_3(X1,X2,X3),X2)
| ~ member(X3,inverse_image2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(empty_set,inverse_image2(esk1_0,empty_set))
| ~ subset(inverse_image2(esk1_0,empty_set),empty_set) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
~ member(X1,inverse_image2(X2,empty_set)),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ subset(inverse_image2(esk1_0,empty_set),empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
subset(inverse_image2(X1,empty_set),X2),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET764+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 17:43:19 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/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.yoeXRdydFH/E---3.1_29172.p
% 0.17/0.43 # Version: 3.1pre001
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # new_bool_3 with pid 29251 completed with status 0
% 0.17/0.43 # Result found by new_bool_3
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.17/0.43 # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29255 completed with status 0
% 0.17/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43 # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.17/0.43 # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.17/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Theorem
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 29
% 0.17/0.43 # Removed by relevancy pruning/SinE : 23
% 0.17/0.43 # Initial clauses : 27
% 0.17/0.43 # Removed in clause preprocessing : 0
% 0.17/0.43 # Initial clauses in saturation : 27
% 0.17/0.43 # Processed clauses : 49
% 0.17/0.43 # ...of these trivial : 0
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 49
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 2
% 0.17/0.43 # Generated clauses : 18
% 0.17/0.43 # ...of the previous two non-redundant : 17
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 18
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Total rewrite steps : 2
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 20
% 0.17/0.43 # Positive orientable unit clauses : 4
% 0.17/0.43 # Positive unorientable unit clauses: 0
% 0.17/0.43 # Negative unit clauses : 4
% 0.17/0.43 # Non-unit-clauses : 12
% 0.17/0.43 # Current number of unprocessed clauses: 22
% 0.17/0.43 # ...number of literals in the above : 72
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 29
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 47
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 29
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 14
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 7
% 0.17/0.43 # BW rewrite match successes : 2
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 2319
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.004 s
% 0.17/0.43 # System time : 0.002 s
% 0.17/0.43 # Total time : 0.006 s
% 0.17/0.43 # Maximum resident set size: 1916 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.004 s
% 0.17/0.43 # System time : 0.004 s
% 0.17/0.43 # Total time : 0.008 s
% 0.17/0.43 # Maximum resident set size: 1740 pages
% 0.17/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------