TSTP Solution File: COL056-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL056-1 : TPTP v8.1.2. Released v1.0.0.
% 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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:28:48 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 10 RR)
% Number of literals : 12 ( 11 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_there_exists_a_happy_bird,negated_conjecture,
response(X1,X2) != X2,
file('/export/starexec/sandbox2/tmp/tmp.w9sZWvkn2i/E---3.1_10176.p',prove_there_exists_a_happy_bird) ).
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.w9sZWvkn2i/E---3.1_10176.p',composer_exists) ).
cnf(a_to_c_responds_b,hypothesis,
response(a,c) = b,
file('/export/starexec/sandbox2/tmp/tmp.w9sZWvkn2i/E---3.1_10176.p',a_to_c_responds_b) ).
cnf(a_to_b_responds_c,hypothesis,
response(a,b) = c,
file('/export/starexec/sandbox2/tmp/tmp.w9sZWvkn2i/E---3.1_10176.p',a_to_b_responds_c) ).
cnf(c_0_4,negated_conjecture,
response(X1,X2) != X2,
inference(fof_simplification,[status(thm)],[prove_there_exists_a_happy_bird]) ).
cnf(c_0_5,negated_conjecture,
response(X1,X2) != X2,
c_0_4 ).
cnf(c_0_6,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_7,negated_conjecture,
response(X1,response(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
response(a,c) = b,
a_to_c_responds_b ).
cnf(c_0_9,hypothesis,
response(a,b) = c,
a_to_b_responds_c ).
cnf(c_0_10,hypothesis,
response(X1,b) != c,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL056-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:37:59 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.w9sZWvkn2i/E---3.1_10176.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 10296 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 10299 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 4
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 4
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 4
% 0.21/0.52 # Processed clauses : 12
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 1
% 0.21/0.52 # ...remaining for further processing : 11
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 9
% 0.21/0.52 # ...of the previous two non-redundant : 7
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 8
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 0
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 6
% 0.21/0.52 # Positive orientable unit clauses : 2
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 4
% 0.21/0.52 # Non-unit-clauses : 0
% 0.21/0.52 # Current number of unprocessed clauses: 3
% 0.21/0.52 # ...number of literals in the above : 3
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 5
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 3
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 93
% 0.21/0.52 # Search garbage collected termcells : 2
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.002 s
% 0.21/0.52 # System time : 0.001 s
% 0.21/0.52 # Total time : 0.003 s
% 0.21/0.52 # Maximum resident set size: 1620 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.004 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.006 s
% 0.21/0.52 # Maximum resident set size: 1684 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------