TSTP Solution File: SYN559-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN559-1 : TPTP v8.1.0. Released v2.5.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 : n022.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 21 06:12:27 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN559-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/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 : n022.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 Jul 12 03:25:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 14 conjectures.
% 0.13/0.37 # There are 14 start rule candidates:
% 0.13/0.37 # Found 6 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 14 start rule tableaux created.
% 0.13/0.37 # 8 extension rule candidate clauses
% 0.13/0.37 # 6 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_16, negated_conjecture, (p8(c13,c9))).
% 0.13/0.37 cnf(i_0_17, negated_conjecture, (p7(c10,c13))).
% 0.13/0.37 cnf(i_0_18, negated_conjecture, (p2(f6(c9,c13),c14))).
% 0.13/0.37 cnf(i_0_19, negated_conjecture, (p2(f5(c14,c10),c15))).
% 0.13/0.37 cnf(i_0_20, negated_conjecture, (p2(f3(f4(c11),c12),c15))).
% 0.13/0.37 cnf(i_0_15, negated_conjecture, (p2(X1,X1))).
% 0.13/0.37 cnf(i_0_21, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.13/0.37 cnf(i_0_22, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.13/0.37 cnf(i_0_23, negated_conjecture, (p8(X1,X2)|~p8(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 0.13/0.37 cnf(i_0_24, negated_conjecture, (p7(X1,X2)|~p7(X3,X4)|~p2(X3,X1)|~p2(X4,X2))).
% 0.13/0.37 cnf(i_0_26, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.37 cnf(i_0_27, negated_conjecture, (p2(f5(X1,X2),f5(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.37 cnf(i_0_28, negated_conjecture, (~p7(c10,X1)|~p8(X1,c9)|~p2(f5(X2,c10),f3(f4(c11),c12))|~p2(f6(c9,X1),X2))).
% 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 8 steps
% 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2(f3(X12,X13),f3(X12,X13))|~p2(X13,X13)|~p2(X12,X12)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_30, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_31, plain, (~p2(X12,X12)), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_29, plain, (p2(f3(X12,X13),f3(X12,X13))), inference(extension_rule, [i_0_25])).
% 0.13/0.37 cnf(i_0_63, plain, (~p2(X14,X14)), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_61, plain, (p2(f3(X14,f3(X12,X13)),f3(X14,f3(X12,X13)))), inference(extension_rule, [i_0_27])).
% 0.13/0.37 cnf(i_0_70, plain, (~p2(X6,X6)), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_68, plain, (p2(f5(X6,f3(X14,f3(X12,X13))),f5(X6,f3(X14,f3(X12,X13))))), inference(etableau_closure_rule, [i_0_68, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Child (5660) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------