TSTP Solution File: HWC003-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWC003-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 17:51:05 EDT 2023
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 41 ( 29 unt; 0 nHn; 19 RR)
% Number of literals : 55 ( 11 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-10 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-8 aty)
% Number of variables : 107 ( 23 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.yPKRFTJXAI/E---3.1_16557.p',inverter_test) ).
cnf(add_inverter_definition2,axiom,
add_inverter(X1,X2) = list(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',add_inverter_definition2) ).
cnf(make_reverse_list_definition2,axiom,
make_reverse_list(X1) = end,
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',make_reverse_list_definition2) ).
cnf(input3,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',input3) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',not_definition2) ).
cnf(create_test,axiom,
( basic_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.yPKRFTJXAI/E---3.1_16557.p',create_test) ).
cnf(basic_output_definition,axiom,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',basic_output_definition) ).
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.yPKRFTJXAI/E---3.1_16557.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.yPKRFTJXAI/E---3.1_16557.p',add_inverter_definition1) ).
cnf(input2,negated_conjecture,
output(n0,n0,n1,n1,n0,n0,n1,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',input2) ).
cnf(input1,negated_conjecture,
output(n0,n0,n0,n0,n1,n1,n1,n1,X1),
file('/export/starexec/sandbox/tmp/tmp.yPKRFTJXAI/E---3.1_16557.p',input1) ).
cnf(c_0_12,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) ),
inverter_test ).
cnf(c_0_13,axiom,
add_inverter(X1,X2) = list(X2,X1),
add_inverter_definition2 ).
cnf(c_0_14,axiom,
make_reverse_list(X1) = end,
make_reverse_list_definition2 ).
cnf(c_0_15,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_16,negated_conjecture,
output(n0,n1,n0,n1,n0,n1,n0,n1,X1),
input3 ).
cnf(c_0_17,axiom,
not(n0) = n1,
not_definition1 ).
cnf(c_0_18,axiom,
not(n1) = n0,
not_definition2 ).
cnf(c_0_19,axiom,
( basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
create_test ).
cnf(c_0_20,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_15,c_0_16]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]),c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
( output(X1,X2,X3,X4,X5,X6,X7,X8,X9)
| ~ basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9) ),
basic_output_definition ).
cnf(c_0_22,negated_conjecture,
basic_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_19,c_0_20]) ).
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) ),
prove_cannot_construct_this ).
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(X2,X3)) = list(X2,list(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_13]),c_0_13]) ).
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_15,c_0_26]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_17]),c_0_17]),c_0_18]),c_0_18]) ).
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,
basic_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_19,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,n0,n0,n1,n1,n0,n0,list(X1,list(X2,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X3))))
| ~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(X2,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),X3)))) ),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_34,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_31]) ).
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_15,c_0_32]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_36,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),list(X1,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,
basic_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_19,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ output(n1,n1,n1,n1,n0,n0,n0,n0,list(X1,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_28]) ).
cnf(c_0_39,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_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : HWC003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 23:56:41 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.yPKRFTJXAI/E---3.1_16557.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # sh5l with pid 16639 completed with status 0
% 0.16/0.45 # Result found by sh5l
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FHHSM-FFMF32-DFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16645 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FHHSM-FFMF32-DFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 25
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 25
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 25
% 0.16/0.45 # Processed clauses : 100
% 0.16/0.45 # ...of these trivial : 11
% 0.16/0.45 # ...subsumed : 13
% 0.16/0.45 # ...remaining for further processing : 76
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 342
% 0.16/0.45 # ...of the previous two non-redundant : 267
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 342
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 256
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 51
% 0.16/0.45 # Positive orientable unit clauses : 35
% 0.16/0.45 # Positive unorientable unit clauses: 3
% 0.16/0.45 # Negative unit clauses : 4
% 0.16/0.45 # Non-unit-clauses : 9
% 0.16/0.45 # Current number of unprocessed clauses: 213
% 0.16/0.45 # ...number of literals in the above : 221
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 25
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 38
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 35
% 0.16/0.45 # Non-unit clause-clause subsumptions : 8
% 0.16/0.45 # Unit Clause-clause subsumption calls : 25
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 36
% 0.16/0.45 # BW rewrite match successes : 10
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 8451
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.010 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1636 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.012 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.014 s
% 0.16/0.45 # Maximum resident set size: 1736 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------