TSTP Solution File: COL054-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL054-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:08 EDT 2024
% Result : Timeout 300.26s 100.61s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 7 RR)
% Number of literals : 15 ( 14 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_birds_are_compatible,negated_conjecture,
( response(a,X1) != X2
| response(b,X2) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.I5IhJWeOL2/E---3.1_13578.p',prove_birds_are_compatible) ).
cnf(composer_exists,hypothesis,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.I5IhJWeOL2/E---3.1_13578.p',composer_exists) ).
cnf(mocking_bird_exists,axiom,
response(mocking_bird,X1) = response(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.I5IhJWeOL2/E---3.1_13578.p',mocking_bird_exists) ).
cnf(c_0_3,negated_conjecture,
( response(a,X1) != X2
| response(b,X2) != X1 ),
inference(fof_simplification,[status(thm)],[prove_birds_are_compatible]) ).
cnf(c_0_4,negated_conjecture,
( response(a,X1) != X2
| response(b,X2) != X1 ),
c_0_3 ).
cnf(c_0_5,hypothesis,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_6,axiom,
response(mocking_bird,X1) = response(X1,X1),
mocking_bird_exists ).
cnf(c_0_7,negated_conjecture,
response(b,response(a,X1)) != X1,
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
response(X1,response(X2,compose(X1,X2))) = response(mocking_bird,compose(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
response(b,response(mocking_bird,compose(a,X1))) != response(X1,compose(a,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,hypothesis,
response(b,response(mocking_bird,compose(a,compose(X1,X2)))) != response(X1,response(X2,compose(a,compose(X1,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,hypothesis,
$false,
inference(er,[status(thm)],[c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : COL054-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 11:32:40 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.I5IhJWeOL2/E---3.1_13578.p
% 300.26/100.61 # Version: 3.1.0
% 300.26/100.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.26/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.26/100.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.26/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.26/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.26/100.61 # Starting sh5l with 300s (1) cores
% 300.26/100.61 # sh5l with pid 13701 completed with status 0
% 300.26/100.61 # Result found by sh5l
% 300.26/100.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.26/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.26/100.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.26/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.26/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.26/100.61 # Starting sh5l with 300s (1) cores
% 300.26/100.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 300.26/100.61 # Search class: FUHPS-FFSF22-SFFFFFNN
% 300.26/100.61 # partial match(1): FUUPS-FFSF22-SFFFFFNN
% 300.26/100.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.26/100.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 300.26/100.61 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 13709 completed with status 0
% 300.26/100.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 300.26/100.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.26/100.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.26/100.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.26/100.61 # Starting new_bool_3 with 300s (1) cores
% 300.26/100.61 # Starting new_bool_1 with 300s (1) cores
% 300.26/100.61 # Starting sh5l with 300s (1) cores
% 300.26/100.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 300.26/100.61 # Search class: FUHPS-FFSF22-SFFFFFNN
% 300.26/100.61 # partial match(1): FUUPS-FFSF22-SFFFFFNN
% 300.26/100.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.26/100.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 300.26/100.61 # Preprocessing time : 0.001 s
% 300.26/100.61 # Presaturation interreduction done
% 300.26/100.61
% 300.26/100.61 # Proof found!
% 300.26/100.61 # SZS status Unsatisfiable
% 300.26/100.61 # SZS output start CNFRefutation
% See solution above
% 300.26/100.61 # Parsed axioms : 3
% 300.26/100.61 # Removed by relevancy pruning/SinE : 0
% 300.26/100.61 # Initial clauses : 3
% 300.26/100.61 # Removed in clause preprocessing : 0
% 300.26/100.61 # Initial clauses in saturation : 3
% 300.26/100.61 # Processed clauses : 12
% 300.26/100.61 # ...of these trivial : 0
% 300.26/100.61 # ...subsumed : 0
% 300.26/100.61 # ...remaining for further processing : 12
% 300.26/100.61 # Other redundant clauses eliminated : 1
% 300.26/100.61 # Clauses deleted for lack of memory : 0
% 300.26/100.61 # Backward-subsumed : 0
% 300.26/100.61 # Backward-rewritten : 0
% 300.26/100.61 # Generated clauses : 11
% 300.26/100.61 # ...of the previous two non-redundant : 8
% 300.26/100.61 # ...aggressively subsumed : 0
% 300.26/100.61 # Contextual simplify-reflections : 0
% 300.26/100.61 # Paramodulations : 9
% 300.26/100.61 # Factorizations : 0
% 300.26/100.61 # NegExts : 0
% 300.26/100.61 # Equation resolutions : 2
% 300.26/100.61 # Disequality decompositions : 0
% 300.26/100.61 # Total rewrite steps : 0
% 300.26/100.61 # ...of those cached : 0
% 300.26/100.61 # Propositional unsat checks : 0
% 300.26/100.61 # Propositional check models : 0
% 300.26/100.61 # Propositional check unsatisfiable : 0
% 300.26/100.61 # Propositional clauses : 0
% 300.26/100.61 # Propositional clauses after purity: 0
% 300.26/100.61 # Propositional unsat core size : 0
% 300.26/100.61 # Propositional preprocessing time : 0.000
% 300.26/100.61 # Propositional encoding time : 0.000
% 300.26/100.61 # Propositional solver time : 0.000
% 300.26/100.61 # Success case prop preproc time : 0.000
% 300.26/100.61 # Success case prop encoding time : 0.000
% 300.26/100.61 # Success case prop solver time : 0.000
% 300.26/100.61 # Current number of processed clauses : 8
% 300.26/100.61 # Positive orientable unit clauses : 2
% 300.26/100.61 # Positive unorientable unit clauses: 1
% 300.26/100.61 # Negative unit clauses : 5
% 300.26/100.61 # Non-unit-clauses : 0
% 300.26/100.61 # Current number of unprocessed clauses: 2
% 300.26/100.61 # ...number of literals in the above : 2
% 300.26/100.61 # Current number of archived formulas : 0
% 300.26/100.61 # Current number of archived clauses : 3
% 300.26/100.61 # Clause-clause subsumption calls (NU) : 0
% 300.26/100.61 # Rec. Clause-clause subsumption calls : 0
% 300.26/100.61 # Non-unit clause-clause subsumptions : 0
% 300.26/100.61 # Unit Clause-clause subsumption calls : 0
% 300.26/100.61 # Rewrite failures with RHS unbound : 0
% 300.26/100.61 # BW rewrite match attempts : 5
% 300.26/100.61 # BW rewrite match successes : 0
% 300.26/100.61 # Condensation attempts : 0
% 300.26/100.61 # Condensation successes : 0
% 300.26/100.61 # Termbank termtop insertions : 240
% 300.26/100.61 # Search garbage collected termcells : 5
% 300.26/100.61
% 300.26/100.61 # -------------------------------------------------
% 300.26/100.61 # User time : 0.004 s
% 300.26/100.61 # System time : 0.000 s
% 300.26/100.61 # Total time : 0.004 s
% 300.26/100.61 # Maximum resident set size: 1644 pages
% 300.26/100.61
% 300.26/100.61 # -------------------------------------------------
% 300.26/100.61 # User time : 0.004 s
% 300.26/100.61 # System time : 0.002 s
% 300.26/100.61 # Total time : 0.006 s
% 300.26/100.61 # Maximum resident set size: 1684 pages
% 300.26/100.61 % E---3.1 exiting
% 300.26/100.62 % E exiting
%------------------------------------------------------------------------------