TSTP Solution File: ALG004-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG004-1 : TPTP v8.1.0. Released v2.2.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 : n021.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:07 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : ALG004-1 : TPTP v8.1.0. Released v2.2.0.
% 0.05/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 : n021.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 : Wed Jun 8 19:43:52 EDT 2022
% 0.13/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_PI_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: 7 Number of unprocessed: 7
% 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.45 # The folding up rule is enabled...
% 0.20/0.45 # Local unification is enabled...
% 0.20/0.45 # Any saturation attempts will use folding labels...
% 0.20/0.45 # 7 beginning clauses after preprocessing and clausification
% 0.20/0.45 # Creating start rules for all 4 conjectures.
% 0.20/0.45 # There are 4 start rule candidates:
% 0.20/0.45 # Found 5 unit axioms.
% 0.20/0.45 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.45 # 4 start rule tableaux created.
% 0.20/0.45 # 2 extension rule candidate clauses
% 0.20/0.45 # 5 unit axiom clauses
% 0.20/0.45
% 0.20/0.45 # Requested 8, 32 cores available to the main process.
% 0.20/0.45 # There are not enough tableaux to fork, creating more from the initial 4
% 0.20/0.46 # There were 1 total branch saturation attempts.
% 0.20/0.46 # There were 0 of these attempts blocked.
% 0.20/0.46 # There were 0 deferred branch saturation attempts.
% 0.20/0.46 # There were 0 free duplicated saturations.
% 0.20/0.46 # There were 1 total successful branch saturations.
% 0.20/0.46 # There were 0 successful branch saturations in interreduction.
% 0.20/0.46 # There were 0 successful branch saturations on the branch.
% 0.20/0.46 # There were 1 successful branch saturations after the branch.
% 0.20/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Begin clausification derivation
% 0.20/0.46
% 0.20/0.46 # End clausification derivation
% 0.20/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.46 cnf(i_0_11, negated_conjecture, (multiply(a,a0)=multiply(b,b0))).
% 0.20/0.46 cnf(i_0_13, negated_conjecture, (multiply(a,c0)=multiply(b,d0))).
% 0.20/0.46 cnf(i_0_12, negated_conjecture, (multiply(d,b0)=multiply(c,a0))).
% 0.20/0.46 cnf(i_0_10, plain, (multiply(multiply(X1,X2),multiply(X3,X4))=multiply(multiply(X1,X3),multiply(X2,X4)))).
% 0.20/0.46 cnf(i_0_14, negated_conjecture, (multiply(d,d0)!=multiply(c,c0))).
% 0.20/0.46 cnf(i_0_9, plain, (X1=X2|multiply(X3,X1)!=multiply(X3,X2))).
% 0.20/0.46 cnf(i_0_8, plain, (X1=X2|multiply(X1,X3)!=multiply(X2,X3))).
% 0.20/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.46 # Begin printing tableau
% 0.20/0.46 # Found 4 steps
% 0.20/0.46 cnf(i_0_14, negated_conjecture, (multiply(d,d0)!=multiply(c,c0)), inference(start_rule)).
% 0.20/0.46 cnf(i_0_17, plain, (multiply(d,d0)!=multiply(c,c0)), inference(extension_rule, [i_0_8])).
% 0.20/0.46 cnf(i_0_24, plain, (multiply(multiply(d,d0),X8)!=multiply(multiply(c,c0),X8)), inference(extension_rule, [i_0_9])).
% 0.20/0.46 cnf(i_0_38, plain, (multiply(X7,multiply(multiply(d,d0),X8))!=multiply(X7,multiply(multiply(c,c0),X8))), inference(etableau_closure_rule, [i_0_38, ...])).
% 0.20/0.46 # End printing tableau
% 0.20/0.46 # SZS output end
% 0.20/0.46 # Branches closed with saturation will be marked with an "s"
% 0.20/0.46 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.46 # We now have 2 tableaux to operate on
% 0.20/0.46 # Found closed tableau during pool population.
% 0.20/0.46 # Proof search is over...
% 0.20/0.46 # Freeing feature tree
%------------------------------------------------------------------------------