TSTP Solution File: COM003-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600s
% DateTime : Fri Jul 15 01:14:51 EDT 2022
% Result : Unsatisfiable 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 18:05:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 43 Number of unprocessed: 43
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 43 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 1 conjectures.
% 0.18/0.36 # There are 1 start rule candidates:
% 0.18/0.36 # Found 1 unit axioms.
% 0.18/0.36 # 1 start rule tableaux created.
% 0.18/0.36 # 42 extension rule candidate clauses
% 0.18/0.36 # 1 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36 # There were 1 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 1 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 1 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_86, negated_conjecture, (algorithm_program_decides(c4))).
% 0.18/0.36 cnf(i_0_51, plain, (program_decides(X1)|~algorithm_program_decides(X1))).
% 0.18/0.36 cnf(i_0_50, plain, (algorithm(X1)|~algorithm_program_decides(X1))).
% 0.18/0.36 cnf(i_0_48, plain, (program_decides(X1)|~program_program_decides(X1))).
% 0.18/0.36 cnf(i_0_47, plain, (program(X1)|~program_program_decides(X1))).
% 0.18/0.36 cnf(i_0_77, hypothesis, (program_program_decides(c1)|~algorithm_program_decides(X1))).
% 0.18/0.36 cnf(i_0_45, plain, (program(f2(X1))|program_decides(X1))).
% 0.18/0.36 cnf(i_0_60, plain, (~program_not_halts2(X1,X2)|~halts2(X1,X2))).
% 0.18/0.36 cnf(i_0_53, plain, (program(X1)|~program_halts2(X1,X2))).
% 0.18/0.36 cnf(i_0_59, plain, (program(X1)|~program_not_halts2(X1,X2))).
% 0.18/0.36 cnf(i_0_52, plain, (algorithm_program_decides(X1)|~algorithm(X1)|~program_decides(X1))).
% 0.18/0.36 cnf(i_0_49, plain, (program_program_decides(X1)|~program(X1)|~program_decides(X1))).
% 0.18/0.36 cnf(i_0_54, plain, (halts2(X1,X2)|~program_halts2(X1,X2))).
% 0.18/0.36 cnf(i_0_62, plain, (halts2(X1,X2)|~halts2_outputs(X1,X2,X3))).
% 0.18/0.36 cnf(i_0_63, plain, (outputs(X1,X2)|~halts2_outputs(X1,X3,X2))).
% 0.18/0.36 cnf(i_0_55, plain, (program_halts2(X1,X2)|~halts2(X1,X2)|~program(X1))).
% 0.18/0.36 cnf(i_0_61, plain, (program_not_halts2(X1,X2)|halts2(X1,X2)|~program(X1))).
% 0.18/0.36 cnf(i_0_78, hypothesis, (program_halts2_halts3_outputs(X1,X2,X3,good)|~program_program_decides(X1))).
% 0.18/0.36 cnf(i_0_65, plain, (program_halts2(X1,X2)|~program_halts2_halts3_outputs(X3,X1,X2,X4))).
% 0.18/0.36 cnf(i_0_57, plain, (outputs(X1,X2)|~halts3_outputs(X1,X3,X4,X2))).
% 0.18/0.36 cnf(i_0_68, plain, (program_not_halts2(X1,X2)|~program_not_halts2_halts3_outputs(X3,X1,X2,X4))).
% 0.18/0.36 cnf(i_0_75, plain, (halts2_outputs(X1,X2,X3)|~program_not_halts2_halts2_outputs(X1,X2,X3))).
% 0.18/0.36 cnf(i_0_79, hypothesis, (program_not_halts2_halts3_outputs(X1,X2,X3,bad)|~program_program_decides(X1))).
% 0.18/0.36 cnf(i_0_46, plain, (program_decides(X1)|~decides(X1,f2(X1),f1(X1)))).
% 0.18/0.36 cnf(i_0_71, plain, (program_halts2(X1,X1)|~program_halts2_halts2_outputs(X2,X1,X3))).
% 0.18/0.36 cnf(i_0_74, plain, (program_not_halts2(X1,X1)|~program_not_halts2_halts2_outputs(X2,X1,X3))).
% 0.18/0.36 cnf(i_0_72, plain, (halts2_outputs(X1,X2,X3)|~program_halts2_halts2_outputs(X1,X2,X3))).
% 0.18/0.36 cnf(i_0_44, plain, (decides(X1,X2,X3)|~program(X2)|~program_decides(X1))).
% 0.18/0.36 cnf(i_0_56, plain, (halts3(X1,X2,X3)|~halts3_outputs(X1,X2,X3,X4))).
% 0.18/0.36 cnf(i_0_69, plain, (halts3_outputs(X1,X2,X3,X4)|~program_not_halts2_halts3_outputs(X1,X2,X3,X4))).
% 0.18/0.36 cnf(i_0_64, plain, (halts2_outputs(X1,X2,X3)|~outputs(X1,X3)|~halts2(X1,X2))).
% 0.18/0.36 cnf(i_0_73, plain, (program_halts2_halts2_outputs(X1,X2,X3)|~halts2_outputs(X1,X2,X3)|~program_halts2(X2,X2))).
% 0.18/0.36 cnf(i_0_66, plain, (halts3_outputs(X1,X2,X3,X4)|~program_halts2_halts3_outputs(X1,X2,X3,X4))).
% 0.18/0.36 cnf(i_0_58, plain, (halts3_outputs(X1,X2,X3,X4)|~outputs(X1,X4)|~halts3(X1,X2,X3))).
% 0.18/0.36 cnf(i_0_76, plain, (program_not_halts2_halts2_outputs(X1,X2,X3)|~halts2_outputs(X1,X2,X3)|~program_not_halts2(X2,X2))).
% 0.18/0.36 cnf(i_0_83, hypothesis, (program(c3)|~program_not_halts2_halts2_outputs(X1,f4(X1),bad)|~program_halts2_halts2_outputs(X1,f4(X1),good)|~program(X1))).
% 0.18/0.36 cnf(i_0_67, plain, (program_halts2_halts3_outputs(X1,X2,X3,X4)|~halts3_outputs(X1,X2,X3,X4)|~program_halts2(X2,X3))).
% 0.18/0.36 cnf(i_0_70, plain, (program_not_halts2_halts3_outputs(X1,X2,X3,X4)|~program_not_halts2(X2,X3)|~halts3_outputs(X1,X2,X3,X4))).
% 0.18/0.36 cnf(i_0_84, hypothesis, (halts2(c3,X1)|~program_not_halts2_halts2_outputs(X2,f4(X2),bad)|~program_halts2_halts2_outputs(X2,f4(X2),good)|~program_halts2(X1,X1)|~program(X2))).
% 0.18/0.36 cnf(i_0_85, hypothesis, (program_not_halts2_halts2_outputs(c3,X1,bad)|~program_not_halts2_halts2_outputs(X2,f4(X2),bad)|~program_halts2_halts2_outputs(X2,f4(X2),good)|~program(X2))).
% 0.18/0.36 cnf(i_0_80, hypothesis, (program(c2)|~program_not_halts2_halts3_outputs(X1,f3(X1),f3(X1),bad)|~program_halts2_halts3_outputs(X1,f3(X1),f3(X1),good)|~program(X1))).
% 0.18/0.36 cnf(i_0_81, hypothesis, (program_halts2_halts2_outputs(c2,X1,good)|~program_not_halts2_halts3_outputs(X2,f3(X2),f3(X2),bad)|~program_halts2_halts3_outputs(X2,f3(X2),f3(X2),good)|~program(X2))).
% 0.18/0.36 cnf(i_0_82, hypothesis, (program_not_halts2_halts2_outputs(c2,X1,bad)|~program_not_halts2_halts3_outputs(X2,f3(X2),f3(X2),bad)|~program_halts2_halts3_outputs(X2,f3(X2),f3(X2),good)|~program(X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 4 steps
% 0.18/0.36 cnf(i_0_86, negated_conjecture, (algorithm_program_decides(c4)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_87, plain, (algorithm_program_decides(c4)), inference(extension_rule, [i_0_77])).
% 0.18/0.36 cnf(i_0_96, plain, (program_program_decides(c1)), inference(extension_rule, [i_0_48])).
% 0.18/0.36 cnf(i_0_200, plain, (program_decides(c1)), inference(etableau_closure_rule, [i_0_200, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 3 tableaux to operate on
% 0.18/0.36 # Found closed tableau during pool population.
% 0.18/0.36 # Proof search is over...
% 0.18/0.36 # Freeing feature tree
%------------------------------------------------------------------------------