TSTP Solution File: ALG012-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG012-1 : TPTP v8.1.0. Released v2.7.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 : n029.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 : Thu Jul 14 16:51:09 EDT 2022
% Result : Unsatisfiable 4.16s 0.89s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG012-1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/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 : n029.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 : Tue Jun 7 23:02:05 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 11 Number of unprocessed: 11
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 11 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 3 conjectures.
% 0.20/0.37 # There are 3 start rule candidates:
% 0.20/0.37 # Found 4 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 3 start rule tableaux created.
% 0.20/0.37 # 7 extension rule candidate clauses
% 0.20/0.37 # 4 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 11 tableaux to operate on
% 4.16/0.89 # There were 2 total branch saturation attempts.
% 4.16/0.89 # There were 0 of these attempts blocked.
% 4.16/0.89 # There were 0 deferred branch saturation attempts.
% 4.16/0.89 # There were 0 free duplicated saturations.
% 4.16/0.89 # There were 2 total successful branch saturations.
% 4.16/0.89 # There were 0 successful branch saturations in interreduction.
% 4.16/0.89 # There were 0 successful branch saturations on the branch.
% 4.16/0.89 # There were 2 successful branch saturations after the branch.
% 4.16/0.89 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.16/0.89 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.16/0.89 # Begin clausification derivation
% 4.16/0.89
% 4.16/0.89 # End clausification derivation
% 4.16/0.89 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.16/0.89 cnf(i_0_17, hypothesis, (c(a1))).
% 4.16/0.89 cnf(i_0_18, hypothesis, (d1(a2))).
% 4.16/0.89 cnf(i_0_19, hypothesis, (d2(a3))).
% 4.16/0.89 cnf(i_0_12, plain, (f(f(X1,X2),X3)=f(X1,f(X2,X3)))).
% 4.16/0.89 cnf(i_0_14, hypothesis, (~d1(X1)|~c(X1))).
% 4.16/0.89 cnf(i_0_15, hypothesis, (~d2(X1)|~c(X1))).
% 4.16/0.89 cnf(i_0_13, plain, (d2(X1)|d1(X1)|c(X1))).
% 4.16/0.89 cnf(i_0_21, negated_conjecture, (c(f(X1,X2))|~d1(X2)|~d1(X1))).
% 4.16/0.89 cnf(i_0_16, hypothesis, (~d2(X1)|~d1(X1))).
% 4.16/0.89 cnf(i_0_22, negated_conjecture, (c(f(X1,X2))|~d2(X2)|~d2(X1))).
% 4.16/0.89 cnf(i_0_20, negated_conjecture, (d2(f(X1,X2))|d1(f(X1,X2))|~c(X2)|~c(X1))).
% 4.16/0.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.16/0.89 # Begin printing tableau
% 4.16/0.89 # Found 8 steps
% 4.16/0.89 cnf(i_0_20, negated_conjecture, (d2(f(a1,a1))|d1(f(a1,a1))|~c(a1)|~c(a1)), inference(start_rule)).
% 4.16/0.89 cnf(i_0_25, plain, (~c(a1)), inference(closure_rule, [i_0_17])).
% 4.16/0.89 cnf(i_0_26, plain, (~c(a1)), inference(closure_rule, [i_0_17])).
% 4.16/0.89 cnf(i_0_24, plain, (d1(f(a1,a1))), inference(extension_rule, [i_0_21])).
% 4.16/0.89 cnf(i_0_70, plain, (~d1(a2)), inference(closure_rule, [i_0_18])).
% 4.16/0.89 cnf(i_0_68, plain, (c(f(a2,f(a1,a1)))), inference(extension_rule, [i_0_14])).
% 4.16/0.89 cnf(i_0_23, plain, (d2(f(a1,a1))), inference(etableau_closure_rule, [i_0_23, ...])).
% 4.16/0.89 cnf(i_0_90, plain, (~d1(f(a2,f(a1,a1)))), inference(etableau_closure_rule, [i_0_90, ...])).
% 4.16/0.89 # End printing tableau
% 4.16/0.89 # SZS output end
% 4.16/0.89 # Branches closed with saturation will be marked with an "s"
% 4.16/0.90 # Child (4019) has found a proof.
% 4.16/0.90
% 4.16/0.90 # Proof search is over...
% 4.16/0.90 # Freeing feature tree
%------------------------------------------------------------------------------