TSTP Solution File: PUZ016-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:12:29 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 32 unt; 0 nHn; 36 RR)
% Number of literals : 40 ( 20 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-8 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(place_vertical_pieces,axiom,
( achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9)))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9)) ),
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',place_vertical_pieces) ).
cnf(first_row_initially,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',first_row_initially) ).
cnf(successor_of_1_is_2,axiom,
successor(n1) = n2,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_1_is_2) ).
cnf(complement_of_not_covered_is_covered,axiom,
complement(not_covered) = covered,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',complement_of_not_covered_is_covered) ).
cnf(complement_of_removed_is_not_covered,axiom,
complement(removed) = not_covered,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',complement_of_removed_is_not_covered) ).
cnf(successor_of_2_is_3,axiom,
successor(n2) = n3,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_2_is_3) ).
cnf(complement_of_covered_is_not_covered,axiom,
complement(covered) = not_covered,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',complement_of_covered_is_not_covered) ).
cnf(successor_of_3_is_4,axiom,
successor(n3) = n4,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_3_is_4) ).
cnf(cover_columns_2_and_3,axiom,
( achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7)) ),
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',cover_columns_2_and_3) ).
cnf(successor_of_4_is_5,axiom,
successor(n4) = n5,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_4_is_5) ).
cnf(successor_of_5_is_6,axiom,
successor(n5) = n6,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_5_is_6) ).
cnf(successor_of_6_is_7,axiom,
successor(n6) = n7,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_6_is_7) ).
cnf(successor_of_7_is_8,axiom,
successor(n7) = n8,
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',successor_of_7_is_8) ).
cnf(prove_row_8_can_be_covered,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
file('/export/starexec/sandbox/tmp/tmp.aAVlVYE6CH/E---3.1_29976.p',prove_row_8_can_be_covered) ).
cnf(c_0_14,axiom,
( achievable(row(successor(X1)),squares(complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8),complement(X9)))
| ~ achievable(row(X1),squares(X2,X3,X4,X5,X6,X7,X8,X9)) ),
place_vertical_pieces ).
cnf(c_0_15,hypothesis,
achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
first_row_initially ).
cnf(c_0_16,axiom,
successor(n1) = n2,
successor_of_1_is_2 ).
cnf(c_0_17,axiom,
complement(not_covered) = covered,
complement_of_not_covered_is_covered ).
cnf(c_0_18,axiom,
complement(removed) = not_covered,
complement_of_removed_is_not_covered ).
cnf(c_0_19,hypothesis,
achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_18]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_20,axiom,
successor(n2) = n3,
successor_of_2_is_3 ).
cnf(c_0_21,axiom,
complement(covered) = not_covered,
complement_of_covered_is_not_covered ).
cnf(c_0_22,hypothesis,
achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_20]),c_0_21]),c_0_17]),c_0_17]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_23,axiom,
successor(n3) = n4,
successor_of_3_is_4 ).
cnf(c_0_24,axiom,
( achievable(row(X1),squares(X2,covered,covered,X3,X4,X5,X6,X7))
| ~ achievable(row(X1),squares(X2,not_covered,not_covered,X3,X4,X5,X6,X7)) ),
cover_columns_2_and_3 ).
cnf(c_0_25,hypothesis,
achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_23]),c_0_17]),c_0_21]),c_0_21]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_26,hypothesis,
achievable(row(n4),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
successor(n4) = n5,
successor_of_4_is_5 ).
cnf(c_0_28,hypothesis,
achievable(row(n5),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_27]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_29,axiom,
successor(n5) = n6,
successor_of_5_is_6 ).
cnf(c_0_30,hypothesis,
achievable(row(n6),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_28]),c_0_29]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_31,axiom,
successor(n6) = n7,
successor_of_6_is_7 ).
cnf(c_0_32,hypothesis,
achievable(row(n7),squares(not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_31]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_33,axiom,
successor(n7) = n8,
successor_of_7_is_8 ).
cnf(c_0_34,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
prove_row_8_can_be_covered ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_32]),c_0_33]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 18:53:01 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.aAVlVYE6CH/E---3.1_29976.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 30054 completed with status 0
% 0.17/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUSF-FFMM32-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 675s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 169s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 169s (1) cores
% 0.17/0.46 # Starting sh5l with 169s (1) cores
% 0.17/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 30059 completed with status 0
% 0.17/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUSF-FFMM32-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 675s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 21
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 21
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 21
% 0.17/0.46 # Processed clauses : 171
% 0.17/0.46 # ...of these trivial : 23
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 148
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 317
% 0.17/0.46 # ...of the previous two non-redundant : 228
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 317
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 1072
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 127
% 0.17/0.46 # Positive orientable unit clauses : 118
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 8
% 0.17/0.46 # Current number of unprocessed clauses: 94
% 0.17/0.46 # ...number of literals in the above : 94
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 21
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 84
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 84
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 457
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 6726
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.010 s
% 0.17/0.46 # Maximum resident set size: 1652 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.043 s
% 0.17/0.46 # System time : 0.007 s
% 0.17/0.46 # Total time : 0.050 s
% 0.17/0.46 # Maximum resident set size: 1692 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------