TSTP Solution File: SET041-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET041-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:21:46 EDT 2023
% Result : Unsatisfiable 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 10 RR)
% Number of literals : 27 ( 6 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(apply_for_composition1,axiom,
( subset(apply(X3,apply(X1,X2)),apply(compose(X3,X1),X2))
| ~ function(X1)
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',apply_for_composition1) ).
cnf(member_of_domain,hypothesis,
member(a,domain_of(a_function)),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',member_of_domain) ).
cnf(a_function,hypothesis,
function(a_function),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',a_function) ).
cnf(two_sets_equal,axiom,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',two_sets_equal) ).
cnf(apply_for_composition2,axiom,
( subset(apply(compose(X2,X1),X3),apply(X2,apply(X1,X3)))
| ~ function(X1) ),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',apply_for_composition2) ).
cnf(prove_apply_for_composition3,negated_conjecture,
apply(another_function,apply(a_function,a)) != apply(compose(another_function,a_function),a),
file('/export/starexec/sandbox/tmp/tmp.gqDyGX6yvR/E---3.1_18153.p',prove_apply_for_composition3) ).
cnf(c_0_6,axiom,
( subset(apply(X3,apply(X1,X2)),apply(compose(X3,X1),X2))
| ~ function(X1)
| ~ member(X2,domain_of(X1)) ),
apply_for_composition1 ).
cnf(c_0_7,hypothesis,
member(a,domain_of(a_function)),
member_of_domain ).
cnf(c_0_8,hypothesis,
function(a_function),
a_function ).
cnf(c_0_9,axiom,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
two_sets_equal ).
cnf(c_0_10,hypothesis,
subset(apply(X1,apply(a_function,a)),apply(compose(X1,a_function),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
( apply(compose(X1,a_function),a) = apply(X1,apply(a_function,a))
| ~ subset(apply(compose(X1,a_function),a),apply(X1,apply(a_function,a))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( subset(apply(compose(X2,X1),X3),apply(X2,apply(X1,X3)))
| ~ function(X1) ),
apply_for_composition2 ).
cnf(c_0_13,negated_conjecture,
apply(another_function,apply(a_function,a)) != apply(compose(another_function,a_function),a),
prove_apply_for_composition3 ).
cnf(c_0_14,hypothesis,
apply(compose(X1,a_function),a) = apply(X1,apply(a_function,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8])]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET041-3 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:25:07 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.gqDyGX6yvR/E---3.1_18153.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 18231 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSS-FFMF21-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 18234 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FHUSS-FFMF21-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Unsatisfiable
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 169
% 0.15/0.42 # Removed by relevancy pruning/SinE : 133
% 0.15/0.42 # Initial clauses : 36
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 36
% 0.15/0.42 # Processed clauses : 93
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 93
% 0.15/0.42 # Other redundant clauses eliminated : 9
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 3
% 0.15/0.42 # Generated clauses : 51
% 0.15/0.42 # ...of the previous two non-redundant : 43
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 2
% 0.15/0.42 # Paramodulations : 40
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 11
% 0.15/0.42 # Total rewrite steps : 10
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 45
% 0.15/0.42 # Positive orientable unit clauses : 9
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 0
% 0.15/0.42 # Non-unit-clauses : 36
% 0.15/0.42 # Current number of unprocessed clauses: 21
% 0.15/0.42 # ...number of literals in the above : 55
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 39
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 432
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 175
% 0.15/0.42 # Non-unit clause-clause subsumptions : 2
% 0.15/0.42 # Unit Clause-clause subsumption calls : 10
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 3
% 0.15/0.42 # BW rewrite match successes : 2
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 3166
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.008 s
% 0.15/0.42 # Maximum resident set size: 2004 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.009 s
% 0.15/0.42 # System time : 0.005 s
% 0.15/0.42 # Total time : 0.014 s
% 0.15/0.42 # Maximum resident set size: 1820 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------