TSTP Solution File: COM003-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COM003-1 : TPTP v8.1.0. Bugfixed v1.0.1.
% 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 : n015.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:50 EDT 2022
% Result : Unsatisfiable 176.59s 24.83s
% Output : CNFRefutation 176.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM003-1 : TPTP v8.1.0. Bugfixed v1.0.1.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 17:17:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y
% 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 50 Number of unprocessed: 44
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 44 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 2 conjectures.
% 0.13/0.38 # There are 2 start rule candidates:
% 0.13/0.38 # Found 1 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 2 start rule tableaux created.
% 0.13/0.38 # 43 extension rule candidate clauses
% 0.13/0.38 # 1 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.13/0.38 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 29 tableaux to operate on
% 5.69/1.18 # Ran out of tableaux, making start rules for all clauses
% 13.58/2.30 # Ran out of tableaux, making start rules for all clauses
% 74.80/10.88 # Ran out of tableaux, making start rules for all clauses
% 106.34/15.38 # Ran out of tableaux, making start rules for all clauses
% 176.59/24.83 # There were 5 total branch saturation attempts.
% 176.59/24.83 # There were 0 of these attempts blocked.
% 176.59/24.83 # There were 0 deferred branch saturation attempts.
% 176.59/24.83 # There were 0 free duplicated saturations.
% 176.59/24.83 # There were 5 total successful branch saturations.
% 176.59/24.83 # There were 0 successful branch saturations in interreduction.
% 176.59/24.83 # There were 0 successful branch saturations on the branch.
% 176.59/24.83 # There were 5 successful branch saturations after the branch.
% 176.59/24.83 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 176.59/24.83 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 176.59/24.83 # Begin clausification derivation
% 176.59/24.83
% 176.59/24.83 # End clausification derivation
% 176.59/24.83 # Begin listing active clauses obtained from FOF to CNF conversion
% 176.59/24.83 cnf(i_0_99, negated_conjecture, (algorithm(c4))).
% 176.59/24.83 cnf(i_0_100, negated_conjecture, (decides(c4,X1,X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_51, hypothesis, (program(f2(X1))|program(c1)|~algorithm(X1))).
% 176.59/24.83 cnf(i_0_63, hypothesis, (program(f5(X1))|program(c2)|~program(X1))).
% 176.59/24.83 cnf(i_0_83, hypothesis, (program(f6(X1))|program(c3)|~program(X1))).
% 176.59/24.83 cnf(i_0_67, hypothesis, (outputs(c2,bad)|halts2(X1,X1)|program(f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_53, hypothesis, (program(c1)|~decides(X1,f2(X1),f1(X1))|~algorithm(X1))).
% 176.59/24.83 cnf(i_0_95, hypothesis, (program(c3)|~outputs(X1,good)|~outputs(X1,bad)|~halts2(X1,f6(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_91, hypothesis, (program(c3)|~outputs(X1,good)|~halts2(f6(X1),f6(X1))|~halts2(X1,f6(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_78, hypothesis, (program(c2)|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_84, hypothesis, (program(f6(X1))|~halts2(c3,X2)|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_52, hypothesis, (decides(c1,X1,X2)|program(f2(X3))|~program(X1)|~algorithm(X3))).
% 176.59/24.83 cnf(i_0_56, hypothesis, (outputs(X1,good)|program(f4(X1))|~halts2(X2,X3)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_54, hypothesis, (decides(c1,X1,X2)|~decides(X3,f2(X3),f1(X3))|~program(X1)|~algorithm(X3))).
% 176.59/24.83 cnf(i_0_65, hypothesis, (outputs(c2,good)|program(f5(X1))|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_86, hypothesis, (outputs(c3,bad)|halts2(X1,X1)|program(f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_57, hypothesis, (halts3(X1,X2,X3)|program(f4(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_60, hypothesis, (outputs(X1,good)|~halts2(X2,X3)|~decides(X1,f4(X1),f3(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_73, hypothesis, (program(c2)|~outputs(X1,good)|~halts3(X1,f5(X1),f5(X1))|~halts2(f5(X1),f5(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_96, hypothesis, (~outputs(X1,good)|~outputs(X1,bad)|~halts2(X1,f6(X1))|~halts2(c3,X2)|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_58, hypothesis, (outputs(X1,bad)|halts2(X2,X3)|program(f4(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_66, hypothesis, (halts2(c2,X1)|program(f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_85, hypothesis, (halts2(c3,X1)|halts2(X1,X1)|program(f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_87, hypothesis, (halts2(f6(X1),f6(X1))|program(c3)|~outputs(X1,bad)|~halts2(X1,f6(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_98, hypothesis, (outputs(c3,bad)|halts2(X1,X1)|~outputs(X2,good)|~outputs(X2,bad)|~halts2(X2,f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_62, hypothesis, (outputs(X1,bad)|halts2(X2,X3)|~decides(X1,f4(X1),f3(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_92, hypothesis, (~outputs(X1,good)|~halts2(f6(X1),f6(X1))|~halts2(X1,f6(X1))|~halts2(c3,X2)|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_68, hypothesis, (halts2(f5(X1),f5(X1))|program(c2)|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~program(X1))).
% 176.59/24.83 cnf(i_0_61, hypothesis, (halts3(X1,X2,X3)|~decides(X1,f4(X1),f3(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_80, hypothesis, (outputs(c2,good)|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_97, hypothesis, (halts2(c3,X1)|halts2(X1,X1)|~outputs(X2,good)|~outputs(X2,bad)|~halts2(X2,f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_94, hypothesis, (outputs(c3,bad)|halts2(X1,X1)|~outputs(X2,good)|~halts2(f6(X2),f6(X2))|~halts2(X2,f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_75, hypothesis, (outputs(c2,good)|~outputs(X1,good)|~halts3(X1,f5(X1),f5(X1))|~halts2(f5(X1),f5(X1))|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_82, hypothesis, (outputs(c2,bad)|halts2(X1,X1)|~outputs(X2,good)|~outputs(X2,bad)|~halts3(X2,f5(X2),f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_90, hypothesis, (outputs(c3,bad)|halts2(f6(X1),f6(X1))|halts2(X2,X2)|~outputs(X1,bad)|~halts2(X1,f6(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_89, hypothesis, (halts2(f6(X1),f6(X1))|halts2(c3,X2)|halts2(X2,X2)|~outputs(X1,bad)|~halts2(X1,f6(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_88, hypothesis, (halts2(f6(X1),f6(X1))|~outputs(X1,bad)|~halts2(X1,f6(X1))|~halts2(c3,X2)|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_93, hypothesis, (halts2(c3,X1)|halts2(X1,X1)|~outputs(X2,good)|~halts2(f6(X2),f6(X2))|~halts2(X2,f6(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_77, hypothesis, (outputs(c2,bad)|halts2(X1,X1)|~outputs(X2,good)|~halts3(X2,f5(X2),f5(X2))|~halts2(f5(X2),f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_81, hypothesis, (halts2(c2,X1)|~outputs(X2,good)|~outputs(X2,bad)|~halts3(X2,f5(X2),f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_70, hypothesis, (outputs(c2,good)|halts2(f5(X1),f5(X1))|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~halts2(X2,X2)|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_76, hypothesis, (halts2(c2,X1)|~outputs(X2,good)|~halts3(X2,f5(X2),f5(X2))|~halts2(f5(X2),f5(X2))|~program(X1)|~program(X2))).
% 176.59/24.83 cnf(i_0_72, hypothesis, (outputs(c2,bad)|halts2(f5(X1),f5(X1))|halts2(X2,X2)|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 cnf(i_0_71, hypothesis, (halts2(f5(X1),f5(X1))|halts2(c2,X2)|~outputs(X1,bad)|~halts3(X1,f5(X1),f5(X1))|~program(X2)|~program(X1))).
% 176.59/24.83 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 176.59/24.83 # Begin printing tableau
% 176.59/24.83 # Found 9 steps
% 176.59/24.83 cnf(i_0_100, negated_conjecture, (decides(c4,f2(c4),f1(c4))|~program(f2(c4))), inference(start_rule)).
% 176.59/24.83 cnf(i_0_101, plain, (decides(c4,f2(c4),f1(c4))), inference(extension_rule, [i_0_53])).
% 176.59/24.83 cnf(i_0_120, plain, (~algorithm(c4)), inference(closure_rule, [i_0_99])).
% 176.59/24.83 cnf(i_0_118, plain, (program(c1)), inference(extension_rule, [i_0_87])).
% 176.59/24.83 cnf(i_0_102, plain, (~program(f2(c4))), inference(etableau_closure_rule, [i_0_102, ...])).
% 176.59/24.83 cnf(i_0_65773, plain, (halts2(f6(c1),f6(c1))), inference(etableau_closure_rule, [i_0_65773, ...])).
% 176.59/24.83 cnf(i_0_65774, plain, (program(c3)), inference(etableau_closure_rule, [i_0_65774, ...])).
% 176.59/24.83 cnf(i_0_65775, plain, (~outputs(c1,bad)), inference(etableau_closure_rule, [i_0_65775, ...])).
% 176.59/24.83 cnf(i_0_65776, plain, (~halts2(c1,f6(c1))), inference(etableau_closure_rule, [i_0_65776, ...])).
% 176.59/24.83 # End printing tableau
% 176.59/24.83 # SZS output end
% 176.59/24.83 # Branches closed with saturation will be marked with an "s"
% 176.59/24.86 # Child (7891) has found a proof.
% 176.59/24.86
% 176.59/24.86 # Proof search is over...
% 176.59/24.86 # Freeing feature tree
%------------------------------------------------------------------------------