TSTP Solution File: HWC003-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HWC003-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 08:02:49 EDT 2024
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 27 unt; 0 nHn; 19 RR)
% Number of literals : 54 ( 12 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-10 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-8 aty)
% Number of variables : 106 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverter_test,axiom,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9)))
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',inverter_test) ).
cnf(make_reverse_list_definition2,axiom,
make_reverse_list(X1) = end,
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',make_reverse_list_definition2) ).
cnf(add_inverter_definition2,axiom,
add_inverter(X1,X2) = list(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',add_inverter_definition2) ).
cnf(create_test,axiom,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',create_test) ).
cnf(input3,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',input3) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',not_definition2) ).
cnf(prove_cannot_construct_this,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',prove_cannot_construct_this) ).
cnf(add_inverter_definition1,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',add_inverter_definition1) ).
cnf(input2,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',input2) ).
cnf(input1,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p',input1) ).
cnf(c_0_11,plain,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9)))
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(fof_simplification,[status(thm)],[inverter_test]) ).
cnf(c_0_12,plain,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(X9,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9)))
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
c_0_11 ).
cnf(c_0_13,axiom,
make_reverse_list(X1) = end,
make_reverse_list_definition2 ).
cnf(c_0_14,axiom,
add_inverter(X1,X2) = list(X2,X1),
add_inverter_definition2 ).
cnf(c_0_15,plain,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
inference(fof_simplification,[status(thm)],[create_test]) ).
cnf(c_0_16,plain,
( test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9),end)
| ~ output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
input3 ).
cnf(c_0_18,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_19,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_20,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1) ),
inference(fof_simplification,[status(thm)],[prove_cannot_construct_this]) ).
cnf(c_0_21,plain,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
test(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1),end),
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(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_16,c_0_17]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ output(n1,n1,n1,n1,n0,n0,n0,n0,X1)
| ~ output(n1,n1,n0,n0,n1,n1,n0,n0,X1)
| ~ output(n1,n0,n1,n0,n1,n0,n1,n0,X1) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
add_inverter(list(X1,X2),X3) = list(X1,add_inverter(X2,X3)),
add_inverter_definition1 ).
cnf(c_0_26,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
input2 ).
cnf(c_0_27,negated_conjecture,
( ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1))
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
list(X1,list(X3,X2)) = list(X3,list(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_14]),c_0_14]) ).
cnf(c_0_29,negated_conjecture,
test(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1),end),
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(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_16,c_0_26]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_18]),c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( ~ output(n1,n1,n0,n0,n1,n1,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
input1 ).
cnf(c_0_33,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
list(X1,list(X2,list(X3,X4))) = list(X3,list(X1,list(X2,X4))),
inference(spm,[status(thm)],[c_0_28,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
test(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1),end),
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(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_16,c_0_32]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_36,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X2)))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : HWC003-1 : TPTP v8.1.2. Released v1.1.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 14:17:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.kmMfU2fVjt/E---3.1_8052.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 8131 completed with status 0
% 0.15/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FHHSM-FFMF32-DFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting sh5l with 136s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 8135 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FHHSM-FFMF32-DFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 24
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 24
% 0.15/0.43 # Removed in clause preprocessing : 2
% 0.15/0.43 # Initial clauses in saturation : 22
% 0.15/0.43 # Processed clauses : 67
% 0.15/0.43 # ...of these trivial : 1
% 0.15/0.43 # ...subsumed : 6
% 0.15/0.43 # ...remaining for further processing : 60
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 222
% 0.15/0.43 # ...of the previous two non-redundant : 203
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 222
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 235
% 0.15/0.43 # ...of those cached : 171
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 38
% 0.15/0.43 # Positive orientable unit clauses : 24
% 0.15/0.43 # Positive unorientable unit clauses: 3
% 0.15/0.43 # Negative unit clauses : 3
% 0.15/0.43 # Non-unit-clauses : 8
% 0.15/0.43 # Current number of unprocessed clauses: 171
% 0.15/0.43 # ...number of literals in the above : 202
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 24
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 29
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 26
% 0.15/0.43 # Non-unit clause-clause subsumptions : 3
% 0.15/0.43 # Unit Clause-clause subsumption calls : 19
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 29
% 0.15/0.43 # BW rewrite match successes : 8
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 7358
% 0.15/0.43 # Search garbage collected termcells : 19
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.006 s
% 0.15/0.43 # System time : 0.004 s
% 0.15/0.43 # Total time : 0.010 s
% 0.15/0.43 # Maximum resident set size: 1692 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.035 s
% 0.15/0.43 # System time : 0.009 s
% 0.15/0.43 # Total time : 0.044 s
% 0.15/0.43 # Maximum resident set size: 1768 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------